Submission #1177975

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<queue>
#include<set>
#define md double
#define LL long long
using namespace std;
const int N=1e6;
int gi() {
	int w=0;bool q=1;char c=getchar();
	while ((c<'0'||c>'9') && c!='-') c=getchar();
	if (c=='-') q=0,c=getchar();
	while (c>='0'&&c <= '9') w=w*10+c-'0',c=getchar();
	return q? w:-w;
}
int str[N];
int nxt[N][27],ST[N][21];
int main()
{
	int n=0,i,m,t,l,r;char c;
	while ((c=getchar())<'a'||'z'<c);
	while ('a'<=c&&c<='z') str[++n]=c-'a',c=getchar();
	for (i=n;i;i--) {
		nxt[i][str[i]]=i+1;
		for (t=str[i];t<26;t++) nxt[i][t+1]=nxt[nxt[i][t]][t];
		for (t=0;t<str[i];t++) nxt[i][t]=nxt[nxt[i][26]][t];
		ST[i][0]=nxt[i][26];
	}
	for (t=0;t<20;t++) for (i=n-(1<<(t+1));i>0;i--) ST[i][t+1]=ST[ST[i][t]][t];
	m=gi();
	while (m--) {
		l=gi(),r=gi()+1;
		for (t=0;ST[l][t]&&ST[l][t]<=r;t++);
		while (--t>=0) if (ST[l][t]&&ST[l][t]<=r) l=ST[l][t];
		puts(l==r?"Yes":"No");
	}
	return 0;
}

Submission Info

Judge Result