Educational Codeforces Round 93 (Rated for Div. 2)C. Good Subarrays[前缀和]

Educational Codeforces Round 93 (Rated for Div. 2)C. Good Subarrays[前缀和]

题目大意：

共T组数据，对于每组数据,给你一个只包含 0-9 的长度为 n $(n<=10^5)$ 的 字符串 a，要求其中有多少个子串满足: $$(\sum _{i=l}^r{a}_i=r-l+1)$$

思路：

设$su{m}_i$表示前 $i$ 个元素的和，那么$$(\sum _{i=l}^r{a}_i=su{m}_r-su{m}_{l-1})$$

• $su{m}_r-su{m}_{l-1}=r-(l-1)$ => $su{m}_r-r=su{m}_{l-1}-(l-1)$ (这个技巧很常见)

• 此时考虑每个以 $a_r$ 结尾的子串，只要前面有 $l$ 满足上式即可，找与 $su{m}_r-r$ 相等的个数结合map即可，时间复杂度 O(nlogn).

input:

3
3
120
5
11011
6
600005

output:

3
6
1

code:

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#include<set>
using namespace std;
#define Please return 
#define Accepted 0
#define int long long
#define endl "\n"
typedef long long LL;
typedef pair<int,int> PII;
typedef pair<double, double> PDD;
const int N = 200010,M=2*N,INF=0x3f3f3f3f,mod=1e9+7;
int n;
int a[N],sum[N];
string s;
void slove(int _case)
{
	cin>>n>>s;
	for(int i=0;i<s.size();i++)	a[i+1]=s[i]-'0';
	for(int i=1;i<=n;i++)	sum[i]=sum[i-1]+a[i];
	int ans=0;
	map<int,int> mp;mp[0]=1;
	for(int i=1;i<=n;i++)
	{
		ans+=mp[sum[i]-i];
		mp[sum[i]-i]++;
//		cout<<"---:"<<ans<<endl;
	}
	cout<<ans<<endl;
}

signed main()
{
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int T=1;
	cin>>T;
	for(int _case=1;_case<=T;_case++)
	{
		slove(_case);
	}
	Please Accepted;
}