|
|
@ -45,14 +45,14 @@ int main() {
|
|
|
|
while (d != 0 && j <= n) {
|
|
|
|
while (d != 0 && j <= n) {
|
|
|
|
// 向后找比avg小的
|
|
|
|
// 向后找比avg小的
|
|
|
|
if (d > 0 && a[j] < avg) {
|
|
|
|
if (d > 0 && a[j] < avg) {
|
|
|
|
int x = min(abs(d), avg - a[j]);
|
|
|
|
int x = min(d, avg - a[j]);
|
|
|
|
a[i] -= x;
|
|
|
|
a[i] -= x;
|
|
|
|
a[j] += x;
|
|
|
|
a[j] += x;
|
|
|
|
d -= x;
|
|
|
|
d -= x;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
// 向后找比avg大的
|
|
|
|
// 向后找比avg大的
|
|
|
|
if (d < 0 && a[j] > avg) {
|
|
|
|
if (d < 0 && a[j] > avg) {
|
|
|
|
int x = min(abs(d), a[j] - avg);
|
|
|
|
int x = min(-d, a[j] - avg);
|
|
|
|
a[i] += x;
|
|
|
|
a[i] += x;
|
|
|
|
a[j] -= x;
|
|
|
|
a[j] -= x;
|
|
|
|
d += x;
|
|
|
|
d += x;
|
|
|
|