刷题巩固-----DAY23（浪漫玻璃杯）

题目链接

Problem - D - Codeforces

#include <bits/stdc++.h>
using namespace std;

int t;
int n;
long long a[200010];
long long b[200010];

bool check() {
    cin >> n;
    b[0] = 0;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        if (i % 2 == 0) a[i] = -a[i];
        b[i] = a[i] + b[i - 1];
    }

    // Check for zero in prefix sums
    for (int i = 1; i <= n; i++) {
        if (b[i] == 0)
            return true;
    }

    // Sort the prefix sums
    sort(b + 1, b + n + 1);

    // Check for duplicate prefix sums
    for (int i = 1; i < n; i++) {
        if (b[i] == b[i + 1]) {
            return true;
        }
    }
    return false;
}

int main() {
    cin >> t;
    while (t--) {
        cout << (check() ? "YES" : "NO") << endl;
    }
    return 0;
}