2111 - 枚举-练习-计算成绩

2111 - 枚举-练习-计算成绩

c++刷题 超能力编程

#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<map>
#include<iostream>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<vector>
using namespace std;
#define ll long long
#define f(i,a,b) for(int i=a;i<=b;i++)
inline ll read(){
   int s=0,w=1;
   char ch=getchar();
   while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
   while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
   return s*w;
}
#define d read()
ll n;
double a[1000010];
double avr[1000010];
double sum[1000010];
double mn[1000010];
double mx;
int main(){
	n=d;
	f(i,1,n+1)mn[i]=10010;
	f(i,1,n)scanf("%lf",&a[i]);
	for(int i=n;i>=2;i--){
		mn[i]=min(mn[i+1],a[i]);
		sum[i]=sum[i+1]+a[i];
		if(i!=n)avr[i]=(sum[i]-mn[i])/(double)(n-i);
	}
	f(i,2,n-1)mx=max(mx,avr[i]);
	f(i,2,n-1)if(mx==avr[i])printf("%lld\n",i-1);
	return 0;
}