C++ 实现整数序列最小修改代价 - 算法题解

#include #include #include using namespace std;

int main() { int n; cin >> n; vector a(n); for (int i = 0; i < n; i++) { cin >> a[i]; }

int minCost = INT_MAX;
for (int x = -1000; x <= 1000; x++) {
    int cost = 0;
    for (int i = 0; i < n; i++) {
        cost += pow(a[i] - x, 2);
    }
    minCost = min(minCost, cost);
}

cout << minCost << endl;

return 0;

}