CF - 808D. Array Division - 二分+暴力+前缀和思维

1.题目描述：

D. Array Division

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Vasya has an array a consisting of positive integer numbers. Vasya wants to divide this array into two non-empty consecutive parts (the prefix and the suffix) so that the sum of all elements in the first part equals to the sum of elements in the second part. It is not always possible, so Vasya will move some element before dividing the array (Vasya will erase some element and insert it into an arbitrary position).

Inserting an element in the same position he was erased from is also considered moving.

Can Vasya divide the array after choosing the right element to move and its new position?

Input

The first line contains single integer n (1 ≤ n ≤ 100000) — the size of the array.

The second line contains n integers a1, a2... an (1 ≤ ai ≤ 109) — the elements of the array.

Output

Print YES if Vasya can divide the array after moving one element. Otherwise print NO.

Examples

input

3
1 3 2

output

YES

input

5
1 2 3 4 5

output

NO

input

5
2 2 3 4 5

output

YES

Note

In the first example Vasya can move the second element to the end of the array.

In the second example no move can make the division possible.

In the third example Vasya can move the fourth element by one position to the left.

2.题意概述：

给你n个数，你只能且必须选出其中一个数并把它剔出来并插在任何位置，问你新的数列能否分成前缀后缀两部分使得这两部分的和相等？

3.解题思路：

最开始还是看x题，没有注意只能选其中一个数，后面又没看到前缀后缀，有点爆炸。

其实一个数的话方法应该很多，因为前后部分相等，那么总和肯定分别为sum/2，如果sum是奇数肯定GG。如果是偶数，考虑O（n）枚举是哪一个剔出来， 假设剔除来是a[i]，则a[i]肯定要么加入前缀集合要么加入后缀集合，两种都尝试一下，查询复杂度也不能太高，考虑前缀和O（1）地查询前缀，如果是加入前缀那么实际上就是查询[1, i - 1]前缀和为sum/2 + a[i]（为什么不是[1,n]？因为如果前缀区间囊括i的话，那么a[i]的拿出和插入就没有意义了！想一想，是不是这样），如果是加入后缀那么其实就是查询前缀和为sum/2-a[i]同理查询的区间是[i + 1, n]。

4.AC代码：

#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define maxn 100100
#define lson root << 1
#define rson root << 1 | 1
#define lent (t[root].r - t[root].l + 1)
#define lenl (t[lson].r - t[lson].l + 1)
#define lenr (t[rson].r - t[rson].l + 1)
#define N 1111
#define eps 1e-6
#define pi acos(-1.0)
#define e exp(1.0)
using namespace std;
const int mod = 1e9 + 7;
typedef long long ll;
typedef unsigned long long ull;
int a[maxn];
ll sum[maxn];
bool check(int L, int R, ll x)
{
	int l = L, r = R, flag = 0;
	while (l <= r)
	{
		int mid = l + r >> 1;
		if (sum[mid] == x)
		{
			flag = 1;
			break;
		}
		if (sum[mid] < x)
			l = mid + 1;
		else
			r = mid - 1;
	}
	return flag;
}
int main()
{
#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
	long _begin_time = clock();
#endif
	int n;
	while (~scanf("%d", &n))
	{
		for (int i = 1; i <= n; i++)
			scanf("%d", &a[i]);
		sum[0]  = 0;
		for (int i = 1; i <= n; i++)
			sum[i] = sum[i - 1] + a[i];
		if (sum[n] & 1)
		{
			puts("NO");
			continue;
		}
		bool flag = 0;
		for (int i = 1; i <= n; i++)
			if (check(i + 1, n, sum[n] / 2 + a[i]))
			{
				flag = 1;
				puts("YES");
				break;
			}
		for (int i = n; i > 0 && !flag; i--)
			if (check(1, i - 1, sum[n] / 2 - a[i]))
			{
				flag = 1;
				puts("YES");
				break;
			}
		if (!flag)
			puts("NO");
	}
#ifndef ONLINE_JUDGE
	long _end_time = clock();
	printf("time = %ld ms.", _end_time - _begin_time);
#endif
	return 0;
}