答案

坤坤  •  23天前


include <stdio.h>

include <math.h>

long long a[1000050];

int main() {

long long n, m, p1, p2, s1, s2, sum1 = 0, sum2 = 0, min, ans1, ans2;
scanf("%lld", &n);
for (int i = 1; i <= n; i++) {
	scanf("%lld", &a[i]);
}
scanf("%lld%lld%lld%lld", &m, &p1, &s1, &s2);
a[p1] += s1;
for (int i = 1; i < m; i++) {
	sum1 = sum1 + a[i] * (m - i);
}
for (int i = m + 1; i <= n; i++) {
	sum2 = sum2 + a[i] * (i - m);
}
min = abs(sum1 - sum2);
p2 = m;
for (int i = 1; i <= n; i++) {
	ans1 = sum1;
	ans2 = sum2;
	if (i < m) {
		ans1 = ans1 + s2 * (m - i);
	}
	if (i > m) {
		ans2 = ans2 + s2 * (i - m);
	}
	if (abs(ans1 - ans2) < min) {
		min = abs(ans1 - ans2);
		p2 = i;
	}
}
printf("%lld", p2);
return 0;

}


评论:

请先登录,才能进行评论