hiho week 233 register

Ended

Participants:96

Verdict:Accepted
Score:100 / 100
Submitted:2018-12-17 10:28:50

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include<iostream>
#include<map>
using namespace std;
const int MAXN=1e5+10;
const int MOD =1e9+7;
int N;
int A[MAXN],f[MAXN],sumA[MAXN],sumf[MAXN];
map<int,int> mp;
int main(){
    cin>>N;
    for(int i=1;i<=N;i++){
        cin>>A[i];
        sumA[i]=sumA[i-1]+A[i];
        sumA[i]%=MOD;
    }
    mp[0]=1;
    f[0]=1;
    sumf[0]=1;
    for(int i=1;i<=N;i++){
        f[i]=sumf[i-1]-mp[sumA[i]];
        f[i]=(f[i]+MOD)%MOD;
        sumf[i]=sumf[i-1]+f[i];
        sumf[i]%=MOD;
        mp[sumA[i]]+=f[i];
        mp[sumA[i]]%=MOD;
    }
    cout<<f[N]<<endl;
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX