50pts求调
  • 板块P4995 跳跳!
  • 楼主CXH114
  • 当前回复0
  • 已保存回复0
  • 发布时间2024/6/15 12:15
  • 上次更新2024/6/15 15:26:08
查看原帖
50pts求调
1082359
CXH114楼主2024/6/15 12:15
#include <bits/stdc++.h>
using namespace std;
int a[301], sum, maxn = -114, imax;
int main() {
    int n, x;

    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        if (maxn < a[i]) {
            maxn = a[i];
            imax = i;
        }
    }
    sum += maxn * maxn;
    x = maxn;
    a[imax] = -1;
    for (int i = 0; i < n - 1; i++) {
        maxn = -114;
        for (int j = n - 1; j >= 0; j--) {
            if ((abs(x - a[j]) > maxn) && (a[j] != -1)) {
                imax = j;
                maxn = abs(x - a[j]);
            }
        }
        sum += maxn * maxn;
        x = a[imax];
        a[imax] = -1;
    }
    cout << sum;
    return 0;
}

2024/6/15 12:15
加载中...