#include<bits/stdc++.h> using namespace std; long long n,a[1000005],s[1000005],cnt[1000005],maxn = -1,k[1000005]; int main(){ cin >> n; for(int i = 0; i < n; i++) cin >> a[i]; for(int i = n-1; i > 0; i--){ s[i] = s[i+1] + a[i]; cnt[i] = n-i-1; long long nmin = 10005; for(int j = i; j < n; j++){ if(nmin > a[j]) nmin = a[j]; } long long ss = s[i] - nmin; k[i] = ss / cnt[i]; cout << k[i] << " "; if(maxn < k[i]) maxn = k[i]; } //cout << maxn; for(int i = 0; i < n; i++){ if(maxn == k[i]){ cout << i << "\n"; } } return 0; }
Note.ms
/1111