题目：

hdu 5146 暴力水题_算法

没什么好讲的，代码如下：

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#define MAX 1007

using namespace std;

long long s[MAX];

bool judge ( int n )
{
    long long sum1 = 0 , sum2 = 0;
    for ( int i = 1 ; i <= n ; i++ )
        if ( i& 1 ) sum1+=s[i];
        else sum2+=s[i];
    if ( sum1 != sum2 ) return false;
    bool flag = true;
    for ( int i = 1 ; i <= n/2+1 ; i++ )
        if ( s[i] != s[n+1-i] ) flag = false;
    if ( flag ) return false;
    return true;
}

int main ( )
{
    int t,n ;
    scanf ( "%d" , &t );
    while ( t-- )
    {
        scanf ( "%d" , &n );
        for ( int i = 1 ; i <= n ; i++ ) scanf ( "%lld" , &s[i] );
        if ( judge( n ) ) puts ( "Yes" );
        else puts ( "No" );
    }
}