E. Special Elements(Round #640 Div. 4) 前缀和

Pay attention to the non-standard memory limit in this problem.

In order to cut off efficient solutions from inefficient ones in this problem, the time limit is rather strict. Prefer to use compiled statically typed languages (e.g. C++). If you use Python, then submit solutions on PyPy. Try to write an efficient solution.

The array a=[a1,a2,…,an] (1≤ai≤n) is given. Its element ai is called special if there exists a pair of indices l and r (1≤l<r≤n) such that ai=al+al+1+…+ar. In other words, an element is called special if it can be represented as the sum of two or more consecutive elements of an array (no matter if they are special or not).

Print the number of special elements of the given array a.

For example, if n=9 and a=[3,1,4,1,5,9,2,6,5], then the answer is 5:

a3=4 is a special element, since a3=4=a1+a2=3+1;
a5=5 is a special element, since a5=5=a2+a3=1+4;
a6=9 is a special element, since a6=9=a1+a2+a3+a4=3+1+4+1;
a8=6 is a special element, since a8=6=a2+a3+a4=1+4+1;
a9=5 is a special element, since a9=5=a2+a3=1+4.
Please note that some of the elements of the array a may be equal — if several elements are equal and special, then all of them should be counted in the answer.

Input
The first line contains an integer t (1≤t≤1000) — the number of test cases in the input. Then t test cases follow.

Each test case is given in two lines. The first line contains an integer n (1≤n≤8000) — the length of the array a. The second line contains integers a1,a2,…,an (1≤ai≤n).

It is guaranteed that the sum of the values of n for all test cases in the input does not exceed 8000.

Output
Print t numbers — the number of special elements for each of the given arrays.

思路：这道题目要找一个数组中有多少个特殊元素，所谓的特殊元素就是在数组中可以找到一个区间[ l , r ]使得al+a[l+1]+…+a[r] = a[ i ]，为了方便计算区间[ l , r ]的和，我们就要用到前缀和，然后用两个循环去遍历所有的区间，就可以得到答案。

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

int main()
{
    int t; cin>>t;
    while(t--){
        int n; cin>>n;
        int a[8010],m[8010]={0};
        for(int i=1;i<=n;i++){
            cin>>a[i];
            m[a[i]]++;
            a[i]=a[i]+a[i-1];// 前缀和
        }
        int count1 = 0;
        for(int i=1;i<n;i++){
            for(int j=i+1;j<=n;j++){
                int sum = a[j]-a[i-1]; //区间[i,j]的和
                if(m[sum]&&sum<=n){
                    count1=count1+m[sum]; 
                    m[sum]=0;
                }
            }
        }
        cout<<count1<<endl;
    }
    return 0;
}

这里还有两题也是用到前缀和的题目
C. Eugene and an array（Round #632 Div 2）
E1. Three Blocks Palindrome (easy version) Round #633 Div. 2)