mirror of
https://github.com/m1ngsama/code4sk.git
synced 2025-12-25 02:56:17 +00:00
69 lines
866 B
C++
69 lines
866 B
C++
/*
|
|
6-1 ?????????????
|
|
?? 10
|
|
?? ??
|
|
?? ??????
|
|
??????????????????????
|
|
|
|
??????:
|
|
int FindArrayMax( int a[], int n );
|
|
??a????????,n???a?????????????a??????
|
|
|
|
????????:
|
|
#include <stdio.h>
|
|
#define MAXN 10
|
|
|
|
int FindArrayMax( int a[], int n );
|
|
|
|
int main()
|
|
{
|
|
int i, n;
|
|
int a[MAXN];
|
|
|
|
scanf("%d", &n);
|
|
for( i=0; i<n; i++ ){
|
|
scanf("%d", &a[i]);
|
|
}
|
|
|
|
printf("%d\n", FindArrayMax(a, n));
|
|
|
|
return 0;
|
|
}
|
|
|
|
????????
|
|
????:
|
|
4
|
|
20 78 99 -14
|
|
????:
|
|
99
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#define MAXN 10
|
|
|
|
int FindArrayMax( int a[], int n );
|
|
|
|
int main()
|
|
{
|
|
int i, n;
|
|
int a[MAXN];
|
|
|
|
scanf("%d", &n);
|
|
for( i=0; i<n; i++ ){
|
|
scanf("%d", &a[i]);
|
|
}
|
|
|
|
printf("%d\n", FindArrayMax(a, n));
|
|
|
|
return 0;
|
|
}
|
|
|
|
int FindArrayMax( int a[], int n ){
|
|
int maxnum=a[0];
|
|
for(int j=0;j<n;j++){
|
|
if(a[j]>maxnum) maxnum=a[j];
|
|
}
|
|
return maxnum;
|
|
}
|
|
|
|
|