Codeforces 1451B. Non-Substring Subsequence(思维+前缀和)

Description

Example

input
2
6 3
001000
2 4
1 3
3 5
4 2
1111
1 4
2 3

output
YES
NO
YES
NO
YES

Solution
如果能找到，必然可以是当前子串丢掉某一段点的子串+另一个点，我们用前缀和判断即可

Code

#include <bits/stdc++.h>
using namespace std;
const int maxn = 4e5 + 10;
int bit[maxn];
int pre[maxn][2], suf[maxn][2];
int main(int argc, char const *argv[])
{
	int T;scanf("%d",&T);
	while(T--) {
		int n,q;scanf("%d%d",&n,&q);
		for(int i = 1;i <= n;++i) {
			scanf("%1d",&bit[i]);
			pre[i][bit[i]] = pre[i-1][bit[i]] + 1;
			pre[i][bit[i]^1] = pre[i-1][bit[i]^1];
		}
		suf[n+1][0] = suf[n+1][1] = 0;
		for(int i = n;i >= 1;--i) {
			suf[i][bit[i]] = suf[i+1][bit[i]] + 1;
			suf[i][bit[i]^1] = suf[i+1][bit[i]^1];
		}
		while(q--) {
			int l,r;scanf("%d %d",&l,&r);
			int f1 = 0, f2 = 0;
			if(l!=1) {
				int x = bit[l];
				if(pre[l-1][x]) f1 = 1;
			}
			if(r!=n) {
				int y = bit[r];
				if(suf[r+1][y]) f2 = 1;
			}if(f1||f2) printf("YES\n"); else printf("NO\n");
		}
	}
	return 0;
}