fail树的dfs序统计子树节点的个数。
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
const int N = 200000;
int ch[N][26],tot,f[N],cnt[N],last[N];
void init(int n){
tot = 0;
memset( ch[0],0,sizeof( ch[0] ) );
}
int ver[2*N],ne[2*N],he[N],tot1;
void add( int x,int y ){
ver[++tot1] = y;
ne[tot1] = he[x];
he[x] = tot1;
}
queue<int> que;
void getfail(){
for( int i = 0;i < 26;i++ ){
if( ch[0][i] ) {
que.push(ch[0][i]);
}
}
while(que.size()){
int x = que.front();
que.pop();
for( int c = 0;c < 26;c++ ){
if( !ch[x][c] ){
ch[x][c] = ch[ f[x] ][c];
continue;
}
f[ ch[x][c] ] = ch[ f[x] ][c];
que.push(ch[x][c]);
}
}
}
int m,pos[maxn],fa[N];
void build( char* str ){
int n = strlen(str);
int p = 0;
for( int i = 0;i < n;i++ ){
if( str[i]=='P' ){
pos[++m] = p;
}else if(str[i]=='B' ){
p = fa[p];
}else{
int c = str[i]-'a';
if( !ch[p][c] ) ch[p][c] = ++tot;
fa[ ch[p][c] ] = p;p = ch[p][c];
}
}
}
char str[maxn];
int l[N],r[N],num;
void dfs( int x ){
l[x] = ++num;
for( int cure = he[x];cure;cure = ne[cure] ){
int y = ver[cure];
dfs(y);
}
r[x] = ++num;
}
int b[N];
int lowbit(int x){
return x&-x;
}
void update( int x,int v ){
while(x<= num){
b[x] += v;
x += lowbit(x);
}
}
int ask( int x ){
int res = 0;
while(x){
res += b[x];
x -= lowbit(x);
}
return res;
}
const int maxk =100005;
int he2[N],ver2[maxk],ne2[maxk],tot2,id[maxk];
void add2( int x,int y,int _id ){
ver2[++tot2] = y;
ne2[tot2] = he2[x];
he2[x] = tot2;
id[tot2] = _id;
}
int ans[maxk];
int main(){
//freopen("C:\\Users\\qqq\\Desktop\\abc.txt","r",stdin);
scanf("%s",str);
build(str);
getfail();
for( int i = 1;i <= tot;i++ ){
add( f[i],i );
}
dfs(0);
int k,x,y;
scanf("%d",&k);
for( int i = 1;i <= k;i++ ){
scanf("%d%d",&x,&y);
//if( x>y ) swap(x,y);
add2( pos[y],pos[x],i );
}
int n = strlen(str);
int p = 0; update( l[0],1 );
int cnt = 0;
for( int i = 0;i < n;i++ ){
char c = str[i];
if( c=='P' ){
for( int cure = he2[p];cure;cure = ne2[cure] ){
int y = ver2[cure];
ans[ id[cure] ] = ask( r[y] ) -ask( l[y]-1 );
}
}else if( c=='B' ){
update( l[p],-1 );
p = fa[p];
}else{
p = ch[p][c-'a'];
update( l[p],1 );
}
}
for( int i = 1;i <= k;i++ ){
printf("%d\n",ans[i]);
}
return 0;
}