题目
题目链接:https://codeforc.es/contest/1398/problem/C
思路
用一个sum每次存上s[i]-1,其转变成求区间和为0的次数。
求区间和为0的次数:
计算第i位的sum
然后第i位的区间和位0的个数就是cnt[sum]
然后cnt[sum]++
代码
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define int long long
using namespace std;
const int INF = 0x3f3f3f3f;
char s[100010];
signed main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int t;
cin>>t;
while(t--){
int n;
cin>>n;
cin>>s+1;
int res=0,a,sum1=0,cnt=0;
map<int,int> mp;
mp[0]=1;
for(int i=1;i<=n;i++){
a=s[i]-'0';
sum1+=a-1;
res+=mp[sum1];
mp[sum1]++;
}
cout<<res<<endl;
}
return 0;
}