【题解】洛谷P4995[【LGR-055】洛谷11月月赛]B.跳跳！ 排序

题目链接

---

#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=301;
ll ans,h[N];
int n,fro,bac;
int main()
{
	//freopen("in.txt","r",stdin);
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	    scanf("%lld",&h[i]);
	sort(h+1,h+n+1);ans=h[n]*h[n];fro=1;bac=n;
	while(fro<bac)
	{
		ans+=(h[bac]-h[fro])*(h[bac]-h[fro]);bac--;
		ans+=(h[bac]-h[fro])*(h[bac]-h[fro]);fro++;
	}
	printf("%lld\n",ans);
	return 0;
}

总结

敢想敢写