【NOIP2018PJ正式赛】龙虎斗

暴力模拟即可。

#include<cstdio>
#include<algorithm>
#define ll long long
using namespace std;
ll n,m,a[100010],s=0,s1,s2,p1;

inline ll read()
{
	ll x=0; char c=getchar();
	while (c<'0' || c>'9') c=getchar();
	while (c>='0' && c<='9') x=x*10+c-48,c=getchar();
	return x;
}

int main()
{
	freopen("fight.in","r",stdin);
	freopen("fight.out","w",stdout);
	n=read();
	for (int i=1;i<=n;i++) a[i]=read();
	m=read(),p1=read(),s1=read(),s2=read();
	for (int i=1;i<=n;i++) s+=a[i]*(m-i);
	s+=s1*(m-p1);ll ans=abs(s+s2*(m-1)),pl=1;
	for (int i=2;i<=n;i++)
		if (abs(s+s2*(m-i))<ans) ans=abs(s+s2*(m-i)),pl=i;
	printf("%lld
",pl);
	return 0;
}