龙虎斗

2018信息学奥林匹克竞赛——复赛试题答案——龙虎斗

题目描述

参考答案

直接枚举

#include<cstdio>
const int N=1e5+5;
int n,m,p1;
long long c[N],s1,s2;
int main()
{
	freopen("fight.in","r",stdin);
	freopen("fight.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%lld",&c[i]);
	}
	scanf("%d%d%lld%lld",&m,&p1,&s1,&s2);
	c[p1]+=s1;
	long long sum=0,mn=1ll<<62;
	for(int i=1;i<=n;i++)
	{
		sum+=1ll*(i-m)*c[i];
	}
	int ans;
	for(int i=1;i<=n;i++)
	{
		long long now=sum+1ll*(i-m)*s2;
		if(now<0)now=-now;
		if(now<mn)mn=now,ans=i;
	}
	printf("%d\n",ans);
	return 0;
 } 

猜你喜欢

转载自blog.csdn.net/BAIMUQIAO/article/details/84521092
今日推荐