CF808D.Array Division

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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?

输入格式

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

The second line contains $n$ integers $a_{1},a_{2}...\ a_{n}$ ( $1<=a_{i}<=10^{9}$ ) — the elements of the array.

输出格式

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

输入输出样例

输入#1
```
3
1 3 2
```
输出#1
```
YES
```
输入#2
```
5
1 2 3 4 5
```
输出#2
```
NO
```
输入#3
```
5
2 2 3 4 5
```
输出#3
```
YES
```

说明/提示

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.

首页