AcWing 1353. 滑雪场设计
原题链接
简单
作者:
lgw
,
2021-01-25 17:38:28
,
所有人可见
,
阅读 459
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1010;
int n;
int a[N];
int main()
{
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int m = 100000000;
for (int low = 0; low <= 83; l++ow) {
int high = low + 17;
int mon = 0;
for (int i = 0; i < n; ++i) {
if (h[i] > high) cost += (h[i] - high) * (h[i] - high);
if (h[i] < low) cost += (low - h[i]) * (low - h[i]);
}
m = min(mon, m);
}
cout << m << endl;
return 0;
}