72分求调

#include<iostream>
#include<cstdio>
using namespace std;
const long long N=2e31;
int main(){
	long long n;
	scanf("%lld",&n);
	long long c[n+1];
	for(int i=1;i<=n;i++)
	scanf("%lld",&c[i]);
	long long m,p1,s1,s2;
	scanf("%lld%lld%lld%lld",&m,&p1,&s1,&s2);
	c[p1]+=s1;
	long long qishi_hu=0,qishi_long=0;
	for(int i=1;i<m;i++)
	qishi_long+=c[i]*(m-i);
	for(int i=m+1;i<=n;i++)
	qishi_hu+=c[i]*(i-m);
	long long qishicha=abs(qishi_hu-qishi_long);
	if(qishicha==0){
		cout<<m;
		return 0;
	}
	long long mn=N,mn_i=1;
	int mn_fb;
	for(int i=1;i<=n;i++){
		if(i==m)
		continue;
		if(i<m){
			qishi_long+=(m-i)*s2;
			mn=min(mn,abs(qishi_long-qishi_hu));
			if(mn<mn_fb)mn_i=i;
			qishi_long-=(m-i)*s2;
		}
		if(i>m){
			qishi_hu+=(i-m)*s2;
			mn=min(mn,abs(qishi_long-qishi_hu));
			if(mn<mn_fb)mn_i=i;
			qishi_hu-=(i-m)*s2;
		}
		mn_fb=mn;
	}
	cout<<mn_i<<endl;
	return 0;
}