龙虎斗游戏 - 最小化势力差距

#include #include using namespace std;

int main() { int n; cin >> n; vector c(n); for (int i = 0; i < n; i++) { cin >> c[i]; } int m, p1, s1, s2; cin >> m >> p1 >> s1 >> s2;

long long sum1 = 0, sum2 = 0;
for (int i = 0; i < n; i++) {
    if (i < m - 1) {
        sum1 += c[i] * (m - 1 - i);
    } else if (i > m - 1) {
        sum2 += c[i] * (i - m + 1);
    }
}

long long minDiff = abs(sum1 - sum2);
int p2 = 1;
for (int i = 2; i <= n; i++) {
    long long diff;
    if (i < m) {
        diff = abs(sum1 + s2 * (m - i) - sum2 - s1 * (m - i + 1));
    } else {
        diff = abs(sum1 - s1 * (i - m) - sum2 + s2 * (i - m));
    }
    if (diff < minDiff) {
        minDiff = diff;
        p2 = i;
    }
}

cout << p2 << endl;

return 0;

}