CSU-ACM暑假集训基础组七夕专场 F - Problem F

F - Problem F

Time Limit:500MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

Submit  Status  Practice  SPOJ NITK06

Description

Suppose we have a sequence of non-negative integers, Namely a₁, a₂, ... ,a_n. At each time we can choose one term a_i with 0 < i < n and we subtract 1 from both a_i and a_i+1. We wonder whether we can get a sequence of all zeros after several operations.

Input

The first line is the number of test cases T ( 0 < T <= 20).

The first line of each test case is a number N. (0 < N <= 10000) The next line is N non-negative integers, 0 <= a_i <= 10⁹

Output

If it can be modified into all zeros with several operations output “YES” in a single line, otherwise output “NO” instead.

Example

Input:
2
2
1 2
2
2 2

Output:
NO
YES

Explanation:

It is clear that [1 2] can be reduced to [0 1] but no further to convert all integers to 0. Hence, the output is NO.

In second case, output is YES as [2 2] can be reduced to [1 1] and then to [0 0] in just two steps.

模拟题，基础。代码如下：

    
    

     
     

      
      
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 10010;
int n,a[N];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        //long long s=0;
        int flag=1,i;
        scanf("%d",&n);
        for( i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
            //s+=a[i];
        }
        for(i=0;i<n-1;)
        {
            a[i+1]-=a[i];
            if(a[i+1]>0)
            i++;
            else if(a[i+1]==0)
            i=i+2;
            else
            {
                flag=0;
                break;
            }
        }
        if(flag&&a[n-1]==0) printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}