求问题

return a > 0 ? a : -a;

int n, m, p1, s1, s2;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
scanf("%d%d%d%d", &m, &p1, &s1, &s2);
a[p1] += s1;
for (int i = 1; i < m; i++)
	left += a[i] * (m - i);
for (int i = m + 1; i <= n; i++)
	right += a[i] * (i - m);
int minno = m, minodd = addodd(right - left);
for (int i = 1; i < m; i++) {
	int temp = left;
	temp += s2 * (m - i);
	if (addodd(temp - right) < minodd) {
		minodd = addodd(temp - right);
		minno = i;
	}
	if (addodd(temp - right == minodd))
		minno = min(i, minno);
}
for (int i = m + 1; i <= n; i++) {
	int temp = right;
	right += s2 * (i - m);
	if (addodd(temp - left) < minodd) {
		minodd = addodd(temp - left);
		minno = i;
	}
	if (addodd(temp - left) == minodd)
		minno = min(i, minno);
}
printf("%d", minno);
return 0;