代码如下：

#include<iostream>
#include<cmath>
using namespace std;
long long tiger=0,dragon=0,s1,s2,p1,p2,m,n,b[101],min_num=9223372036854775807;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>b[i];
	}
	cin>>m>>p1>>s1>>s2;
	for(int i=1;i<m;i++){
		dragon+=i*b[i];
	}
	for(int i=m+1;i<=n;i++){
		tiger+=(i-m)*b[i];
	}
	if(p1<m) dragon+=p1*s1;
	if(p1>m) tiger+=(p1-m)*s1;
	for(int i=1;i<=n;i++){
		if(i<m){
			dragon+=i*s2;
			if(abs(dragon-tiger)<min_num){
				min_num=abs(dragon-tiger);
				p2=i;
			}
			dragon-=i*s2;
		}
		if(i==m){
			if(abs(dragon-tiger)<min_num){
				min_num=abs(dragon-tiger);
				p2=i;
			}
		}
		if(i>m){
			tiger+=(i-m)*s2;
			if(abs(dragon-tiger)<min_num){
				min_num=abs(dragon-tiger);
				p2=i;
			}
			tiger-=(i-m)*s2;
		} 
	}
	cout<<p2;
	return 0;
}