您的位置:首页 > 其它

1.3.6(extra)

2016-03-25 15:56 295 查看
/*
ID:18861501
LANG:C++
TASK:skidesign
*/
/*------------------Header Files------------------*/
#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <ctype.h>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <vector>
#include <limits.h>
using namespace std;
/*------------------Definitions-------------------*/
#define LL long long
#define PI acos(-1.0)
#define INF 0x3F3F3F3F
/*---------------------Work-----------------------*/
int s[1005];
bool cmp(int a,int b)
{
return a<b;
}
void work()
{
int N;
scanf("%d",&N);
for(int i=1;i<=N;i++)
scanf("%d",&s[i]);
sort(s+1,s+N+1,cmp);
int low=s[1],high=s
;
int min_money=INF;
for(int i=low;i<=high-17;i++) //数据量小,直接暴力
{
int left=i,right=i+17,sum=0;
for(int i=1;i<=N;i++)
{
if(s[i]<left) sum+=(left-s[i])*(left-s[i]);
else if(s[i]>right) sum+=(s[i]-right)*(s[i]-right);
}
min_money=min(sum,min_money);
}
printf("%d\n",min_money);
}
/*------------------Main Function------------------*/
int main()
{
//freopen("test.txt","r",stdin);
freopen("skidesign.out","w",stdout);
freopen("skidesign.in","r",stdin);
work();
return 0;
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: