AcWing 1353. 滑雪场设计
原题链接
简单
作者:
wjie
,
2021-01-25 10:29:21
,
所有人可见
,
阅读 312
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
const int N = 1e3 + 5;
int values[N];
int main()
{
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) scanf("%d", &values[i]);
int res = 0x3f3f3f3f;
for (int i = 0; i <= 100-17; ++i)
{
int temp = 0;
for (int j = 0; j < n; ++j)
{
if (values[j] < i) temp += pow(i-values[j], 2);
else if (values[j] > i+17) temp += pow(i+17-values[j], 2);
}
res = min(res, temp);
}
printf("%d", res);
return 0;
}