SPOJ CRAN02 - Roommate Agreement

题目链接：http://www.spoj.com/problems/CRAN02/

题目大意：N个数字组成的序列，和为0的连续子序列的个数。N<1e6

解题思路：计算前缀和，统计每个数字出现的次数，那么对于数字sum[i], 如果存在k个sum[i]，则代表有C(k, 2)个序列和为0，而如果sum[i] = 0，则还要累加上对应的k值。

代码：

ll n;
int a[maxn];
ll sum[maxn];
map<int, int> mmp;

void solve(){
    memset(sum, 0, sizeof(sum));
    for(int i = 1; i <= n; i++) {
        sum[i] = sum[i - 1] + a[i];
        mmp[sum[i]]++;
    }
    ll ans = 0;
    for(int i = 1; i <= n; i++){
        ll k = mmp[sum[i]];
        if(sum[i] == 0) ans += k;
        mmp[sum[i]] = 0;
        if(k >= 2) ans += k * (k - 1) / 2;
    }
    printf("%lld\n",ans);
} 
int main(){
    int t;
    scanf("%d", &t);
    for(int i = 1; i <= t; i++){
        mmp.clear();
        scanf("%lld", &n);
        for(int j = 1; j <= n; j++) 
            scanf("%d", &a[j]);
        solve();
    }
}

题目：

CRAN02 - Roommate Agreement

#math #ad-hoc-1

 

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