洛谷P4995 跳跳！进阶解法

#include<iostream>#include<algorithm>using namespace std;constexpr int MAX_LENGTH = 300;int n, h[MAX_LENGTH], g[MAX_LENGTH + 10];long long sum;int main(){cin >> n;for (int i = 0; i &

GoldenLegendary

205人浏览 · 2021-07-18 10:12:32

GoldenLegendary · 2021-07-18 10:12:32 发布

#include<iostream>
#include<algorithm>

using namespace std;
constexpr int MAX_LENGTH = 300;
int n, h[MAX_LENGTH], g[MAX_LENGTH + 10];
long long sum;

int main()
{
	cin >> n;
	for (int i = 0; i < n; i++)
		cin >> h[i];
	sort(h, h + n);
	for (int i = 0; i < (n + 1) / 2; i++)
	{
		g[2 * i] = h[n - 1 - i];
		g[2 * i + 1] = h[i];
	}
	sum += g[0] * g[0];
	for (int i = 1; i < n; i++)
		sum += (g[i] - g[i - 1]) * (g[i] - g[i - 1]);
	cout << sum;
	return 0;
}