摘要： #include void findmax ( int s[ ], int t, int *k ) { int i; *k = 0; for ( i = 1; i < t; i++) { if ( s[*k] < s[i] ) *k = i; } return ; } int main (void) { int a[10] = {12, 23, 34... 阅读全文