64分求助
查看原帖
64分求助
932505
_LTC_Augenstern_楼主2023/10/6 13:02
#include <bits/stdc++.h>
#define int ll
#define IOS ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
using namespace std;
typedef long long ll;
int n, m, p1, s1, s2, tmp, value1, value2, minn = INT_MAX, pos;
vector<int> sldr;
signed main()
{
	IOS;
	cin >> n;
	sldr.push_back(0);
	for(int i = 0; i < n; i ++) cin >> tmp, sldr.push_back(tmp);
	cin >> m >> p1 >> s1 >> s2;
	sldr[p1] += s1;
	for(int i = 1; i < m; i ++) value1 += sldr[i] * (m - i);
	for(int i = m + 1; i <= n; i ++) value2 += sldr[i] * (i - m);
	for(int i = 1; i <= m; i ++) 
	{
		value1 += s2 * (m - i);
		if(abs(value1 - value2) < minn) minn = abs(value1 - value2), pos = i; 
		value1 -= s2 * (m - i);
	}
	cout << pos;
	return 0;
}
2023/10/6 13:02
加载中...