40分，求调！

#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

const int MAXN = 1e5;
int n, c[MAXN + 10], q[MAXN + 10],  m, p1, s1, s2, ql, qr;

int main(void)
{
	cin >> n;
	for(int i = 1;i <= n;i++)
	{
		cin >> c[i];
	}
	cin >> m >> p1 >> s1 >> s2;
	for(int i = 1;i <= n;i++)
	{
		q[i] = c[i] * abs(m - i);
		if(i < m){ql += q[i];}
		if(i > m){qr += q[i];}
	}
	if(p1 < m){ql += s1 * abs(m - p1);}
	if(p1 > m){qr += s1 * abs(m - p1);}
	int minid = -1;
	if(ql > qr)
	{
		minid = (ql - qr) / s2 + m;
		if(abs(qr + (minid - m) * s2 - ql) > abs(qr + (minid - m + 1) * s2 - ql)){minid++;}
		if(abs(qr + (minid - m) * s2 - ql) > abs(qr + (minid - m - 1) * s2 - ql)){minid--;}
	}
	else
	{
		minid = (qr - ql) / s2;
		if(abs(ql + (m - minid) * s2 - qr) > abs(ql + (m - minid + 1) * s2 - qr)){minid++;}
		if(abs(ql + (m - minid) * s2 - qr) > abs(ql + (m - minid - 1) * s2 - qr)){minid--;}
	}
	cout << minid << endl;
	return 0;
}