64分玄关 #P5016龙虎斗
  • 板块灌水区
  • 楼主qi_feng_yi
  • 当前回复3
  • 已保存回复3
  • 发布时间2024/9/2 16:26
  • 上次更新2024/9/2 21:20:58
查看原帖
64分玄关 #P5016龙虎斗
1384758
qi_feng_yi楼主2024/9/2 16:26
#include <bits/stdc++.h> 
#include <iostream>
#define ll long long
using namespace std;

ll n,c[100006],m,p1,s1,s2;
ll sum ,num, minn = 1e18,ans;

int main(){
	cin >> n;
	for(int i = 1;i<= n;i++) cin >> c[i];
	cin >> m >> p1 >> s1 >> s2;
	
	c[p1] += s1;
	for(int i = 1;i < m;i++){
		sum += c[i]*(m - i);
	}
	for(int i = m +1;i <= n;i++){
		num += c[i]*(i - m);
	}
	
	for(int i = 1; i <= n;i++){
		if(i < m){
			if(minn > abs(sum + s2*(m - i) - num)){
				minn = abs(sum + s2*(m - i) - num);
				ans = i;
			}
		}
		else{
			if(minn > abs(num + s2*(m - i) - sum)){
				minn = abs(num + s2*(m - i) - sum);
				ans = i;
			}
		}
	}
	cout << ans;
}
2024/9/2 16:26
加载中...