hdu 5146 Sequence

最新推荐文章于 2022-11-17 00:01:32 发布

GadyPu

最新推荐文章于 2022-11-17 00:01:32 发布

阅读量390

点赞数

分类专栏：杂题

本文链接：https://blog.csdn.net/u012077152/article/details/46685145

版权

杂题专栏收录该内容

54 篇文章 0 订阅

订阅专栏

原题链接：http://acm.hdu.edu.cn/showproblem.php?pid=5146
手速题。。。

#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<vector>
#include<map>
#include<set>
using std::cin;
using std::cout;
using std::endl;
using std::find;
using std::sort;
using std::set;
using std::map;
using std::pair;
using std::vector;
using std::multiset;
using std::multimap;
#define pb(e) push_back(e)
#define sz(c) (int)(c).size()
#define mp(a, b) make_pair(a, b)
#define all(c) (c).begin(), (c).end()
#define iter(c) decltype((c).begin())
#define cls(arr,val) memset(arr,val,sizeof(arr))
#define cpresent(c, e) (find(all(c), (e)) != (c).end())
#define rep(i, n) for (int i = 1; i <= (int)(n); i++)
#define tr(c, i) for (iter(c) i = (c).begin(); i != (c).end(); ++i)
const int Max_N = 1010;
typedef unsigned long long ull;
int arr[Max_N];
int main() {
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w+", stdout);
#endif
    int t, n;
    ull sum1, sum2;
    scanf("%d", &t);
    while (t--) {
        bool f = false;
        sum1 = sum2 = 0;
        scanf("%d", &n);
        rep(i, n) {
            scanf("%d", &arr[i]);
            if (i & 1) sum1 += arr[i];
            else sum2 += arr[i];
        }
        if (sum1 != sum2) { puts("No"); continue; }
        for (int i = 1, j = n; i < j; i++, j--) {
            if (arr[i] != arr[j]) { f = true; break; }
        }
        puts(f ? "Yes" : "No");
    }
    return 0;
}