考场写挂的模拟，终和省一无缘，AFO

#include<cstdio>
#include<cmath> 
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define ll long long
using namespace std;
int read()
{
	char ch;int res=0,f=1;
	while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') res=res*10+ch-48,ch=getchar();
	return res*f;
}
int n,m,p1,s1,s2;
int c[100005];
ll len;
int main()
{
	freopen("fight.in","r",stdin);
	freopen("fight.out","w",stdout); 
	n=read();
	for(int i=1;i<=n;i++)c[i]=read();
	m=read(),p1=read(),s1=read(),s2=read();
	c[p1]+=s1;
	ll minn=min(m-1,n-(m+1)+1);
	for(int i=1;i<=minn;i++)
	{
		len=c[m-i]*i-c[m+i]*i;//sum1-sum2
	}
	if((m-1)-minn>0)//虎的长度还有剩余
	{
		for(int i=1;i<=(m-1)-minn;i++)
		len+=c[i]*(m-i);
	}
	else{
		for(int i=m+n-(m+1)+1;i<=n;i++)
		len-=c[i]*(i-m);
	}
	if(len<0)//如果虎比龙大 
	{
		len=-len;
		ll nest=0x7fffffffll;
		int ans;
		ll tot=len/s2;//所需要加的地方的距离
		for(int i=1;i<=m-1;i++)//在虎里找地方 
		{
			if(abs(tot-(m-i))<nest)
			{
				nest=abs(tot-(m-i));
				ans=i;
				if(nest==0) break;
			}
		}
		printf("%d\n",ans);
	}
	else if(len>0)//如果龙比虎大 
	{
		ll nest=0x7fffffffll;
		int ans;
		ll tot=len/s2;//所需要加的地方的距离
		for(int i=m+1;i<=n;i++)//在龙里找地方 
		{
			if(abs(tot-(i-m))<nest)
			{
				nest=abs(tot-(i-m));
				ans=i;
				if(nest==0) break;
			}
		}
		printf("%d\n",ans);
	}
	else if(len==0)//相同的时候在m 
	{
		printf("%d\n",m);
	}
	return 0;
}