#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int m,n,s1,p1,s2,a[500010];
long long ans=0;
int minn=1e9;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	cin>>m>>p1>>s1>>s2;
	a[p1]+=s1;
	int sum1=0,sum2=0;
	for(int i=1;i<=n;i++){
		if(i==m){
			continue;
		}
		if(i<m){
			sum1+=(m-i)*a[i];
		}
		else if(i>m){
			sum2+=(i-m)*a[i];
		}
	}
	for(int i=1;i<=n;i++){
		if(i<m){
			sum1+=(m-i)*s2;
		}
		if(i>m){
			sum2+=(i-m)*s2;
		}
		if(i==m){
			continue;
		}
		int tm1=abs(sum1-sum2);
		if(min>tm1){
			ans=i;
		}
		if(i<m){
			sum1-=(m-i)*s2;
		}
		if(i>m){
			sum2-=(i-m)*s2;
		}
	}
	cout<<ans;
	return 0;
}

为什么39行报错