Educational Codeforces Round 21 D. Array Division

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.

昨晚这题一直没有过 今天早晨看了看大佬的博客 思路都是一样的  但是发现自己多了一步特判

但是还是没想明白为啥自己的特判不对 (注释中有提到)

令这n个数存在数组里 分别对应a[1],a[2]...a[n]

设n项总和为sum  前i项的和为sum1 则(i+1)项到n项的和为 sum2=sum-sum1

什么条件下才能符合题集呢

第一种情况就是 sum2比sum1大  那么要从sum2中拿走某一项 假设拿走的是第m项 (m>=i+1&&m<=n)

如果成立 那么就是sum2-a[m] == sum1+a[m]

移项可得 sum2-sum1 == 2 * a[m]

另一种情况是sum1比sum2大的情况 与第一种情况类似

#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<stack>
#include<queue>
#include<cmath>
#include<stack>
#include<list>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
ll a[1000005];
ll suma[1000005];  //suma[i]代表前i项的和
set<long long>s;
int main()
{
       int n,i,j,k;
        scanf("%d",&n);
        if(n==1)
        {
            printf("NO\n");
            return 0;
        }
        ll sum=0;
        suma[0]=0;
        for(i=1;i<=n;i++)
        {
            scanf("%lld",&a[i]);
            sum+=a[i];
            suma[i]=sum;
        }
        /* if(sum%2==1)
        {
            printf("NO\n");
            return 0;
        } */   //这是我当时的特判 很迷吧 加上这句话就过不了...
        s.clear();
        int flag=0;

        for(i=1;i<=n;i++)  //第一种情况
        {
            if(s.count(2*a[i]))
            {
                flag=1;
                break;
            }
            ll t=sum-2*suma[i];  //sum-suma[i]就是上面讲解中的sum2  再减去一个suma[i]就是sum2-sum1
            if(t==0)  //无需移动
            {
                flag=1;
                break;
            }
            if(t>0)
            {
                s.insert(t);
            }
        }
        if(flag)
        {
            printf("YES\n");
           return 0;
        }
        s.clear();
        for(i=n;i>=1;i--)  //第二种情况
        {
            if(s.count(2*a[i]))
            {
                flag=1;
                break;
            }
            ll t=2*suma[i]-sum;// 其实是sum-2*(sum-suma[i])
            if(t==0)
            {
                flag=1;
                break;
            }
            if(t>0)
            {
                s.insert(t);
            }
        }
        if(flag)
            printf("YES\n");
        else printf("NO\n");



    return 0;
}