#include <stdio.h> void findmax ( int s[ ], int t, int *k )
{
int i;
*k = ; for ( i = ; i < t; i++)
{
if ( s[*k] < s[i] ) *k = i;
} return ;
} int main (void)
{
int a[] = {, , , , , , , , , }, k;
findmax ( a, , &k );
printf ( “ 最大元素为:%d, 其下标值为:%d\n”, a[k], k );
return ;
}