Submission #73108684

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long

int n,a[610000];
int sum[610000];
int ams[610000],cnt;

signed main()
{
	cin >> n;
	for(int i = 1;i <= n;i++)
	{
		cin >> a[i];
	}
	sort(a + 1,a + n + 1);
	bool ok = true;
	int ans = a[1] + a[n];
	ok = true;
	for(int i = 2,j = n - 1;i < j;i++,j--)
	{
		int res = a[i] + a[j];
		if(ans != res)
		{
			ok = false;
		}
	}
	if(n % 2 == 1 && a[n / 2 + 1] != ans){ok = false;}
	if(ok && ams[cnt] != ans){cnt++;ams[cnt] = ans;}
	int x = a[n];
	for(int i = 1;i <= n;i++){sum[i] = sum[i - 1] + a[i];}
	ok = true;
	for(int i = 1;i <= n;i++)
	{
		int r = i;
		while(r < n)
		{
			if(sum[r] - sum[i - 1] == x)
			{
				break;
			}
			r++;
			if(sum[r] - sum[i - 1] == x)
			{
				break;
			}
		}
		if(sum[r] - sum[i - 1] == x)
		{
			i = r;
		}
		else
		{
			ok = false;
			break;
		}
	}
	if(ok && ams[cnt] != x)
	{
		cnt++;
		ams[cnt] = x;
	}
	sort(ams + 1,ams + cnt + 1);
	for(int i = 1;i <= cnt;i++)
	{
		cout << ams[i] << " ";
	}
}

Submission Info

Judge Result