'commit'

TangDou/CSP-J/AcWingTraining/T4/474.cpp

@@ -0,0 +1,35 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+#define int long long
+
+const int N = 100010;
+
+int n;
+int m, p1, p2, s1, s2;
+int c[N];
+
+signed main() {
+    cin >> n;                                 // 代表兵营的数量
+    for (int i = 1; i <= n; i++) cin >> c[i]; // 起始时的工兵数量 ci
+    cin >> m >> p1 >> s1 >> s2;
+    // 以 m 号兵营作为分界
+    // s1 位工兵突然出现在了 p1 号兵营
+    // 需要选择一个兵营 p2，并将你手里的 s2 位工兵全部派往兵营 p2
+    c[p1] += s1;
+
+    int s = 0;
+    for (int i = 1; i <= n; i++) s += c[i] * (m - i); // 双方气势差距
+
+    int res = 1e18;
+    for (int i = 1; i <= n; i++) { // 遍历每个兵营，看看放哪个兵营差距最小
+        int t = (m - i) * s2 + s;
+        if (abs(t) < res) {
+            res = abs(t);
+            p2 = i;
+        }
+    }
+
+    printf("%lld\n", p2);
+    return 0;
+}