SPOJ-CRAN02

CRAN02 - Roommate Agreement

 

Leonard was always sickened by how Sheldon considered himself better than him. To decide once and for all who is better among them they decided to ask each other a puzzle. Sheldon pointed out that according to Roommate Agreement Sheldon will ask first. Leonard seeing an opportunity decided that the winner will get to rewrite the Roommate Agreement.

Sheldon thought for a moment then agreed to the terms thinking that Leonard will never be able to answer right. For Leonard, Sheldon thought of a puzzle which is as follows. He gave Leonard n numbers, which can be both positive and negative. Leonard had to find the number of continuous sequence of numbers such that their sum is zero.

 For example if the sequence is- 5, 2, -2, 5, -5, 9

There are 3 such sequences

2, -2

5, -5

2, -2, 5, -5

Since this is a golden opportunity for Leonard to rewrite the Roommate Agreement and get rid of Sheldon's ridiculous clauses, he can't afford to lose. So he turns to you for help. Don't let him down.

Input

First line contains T - number of test cases

Second line contains n - the number of elements in a particular test case.

Next line contain n elements, ai  (1<=i<= n) separated by spaces.

Output

The number of such sequences whose sum if zero.

Constraints

1<=t<=5

1<=n<=10^6

-10<= ai <= 10

Example

Input:

2

4

0 1 -1 0

6

5 2 -2 5 -5 9

Output:

6
3

题意

给你一个序列，里面n(10^6)个数字，问这些数字相加为0的区间有多少个

思路

看样例解释我们可以知道，可以利用前缀和来计算，a[i]=a[i]+a[i-1]这样，然后用map来存a[i]出现的次数，如果有x个a[i]出现，则说明其中存在序列和为0的情况，

并且可能的情况为1~x-1种,如果a[i]刚好=0，则还要加上当前这个。

/*
    Name: hello world.cpp
    Author: AA
    Description: 唯代码与你不可辜负
*/
#include<bits/stdc++.h>
using namespace std;
#define LL long long
int main() {
    int t;
    cin >> t;
    while(t--) {
        int n;
        cin >> n;
        LL a[n];
        map<LL, LL> cnt;
        cin >> a[0];
        cnt[a[0]]++;
        for(int i = 1; i < n; i++) {
            cin >> a[i];
            a[i] += a[i - 1];
            cnt[a[i]]++;
        }
        map<LL, LL>::iterator it;
        LL ans = 0;
        for(it = cnt.begin(); it != cnt.end(); it++) {
            if(it->first == 0)
                ans += it->second + it->second * (it->second - 1) / 2;
            else
                ans += it->second * (it->second - 1) / 2;
        }
        cout << ans << endl;
    }
    return 0;
}