题解

#include<iostream>
#include<algorithm>
using namespace std;

int n,a[10005];
int maxn=INT32_MIN;
int main() {
    cin>>n;
    for (int i=1;i<=n;i++){
        cin>>a[i];
        maxn=max(maxn,a[i]);
    }
    cout<<find(a+1,a+n+1,maxn)-a;
    return 0;
}