- chenxueze's blog
2038:【例5.5】最大数位置
- 2024-12-17 17:39:11 @
#include<bits/stdc++.h>
using namespace std;
int k;
int main() {
int n,s[1010];
cin >> n;
int a;
for (int i = 1; i <= n; i++) {
cin >> a;
s[i] = a;
}
for (int i = 1 ;i <= n ; i++) {
if (s[i] > s[k]) {
k = i;
}
}
cout << k;
return 0;
}