51nod1600（LCT，树链剖分，后缀自动机）

传送门：http://www.51nod.com/Challenge/Problem.html#!#problemId=1600
题面描述：
对于一个字符串|S|，我们定义fail[i]，表示最大的x使得S[1…x]=S[i-x+1…i]，满足(x<i)
显然对于一个字符串，如果我们将每个0<=i<=|S|看成一个结点，除了i=0以外i向fail[i]连边，这是一颗树的形状，根是0
我们定义这棵树是G(S)，设f(S)是G(S)中除了0号点以外所有点的深度之和，其中0号点的深度为-1
定义key(S)等于S的所有非空子串S’的f(S’)之和
给定一个字符串S，现在你要实现以下几种操作：
1.在S最后面加一个字符
2.询问key(S)

善良的出题人不希望你的答案比long long大，所以你需要将答案对1e9+7取模

$|S|\le 10^5$

---

#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = j;i <= k;++i)
#define repp(i,j,k) for(int i = j;i >= k;--i)
#define ll long long
#define pb push_back
#define SZ(x) ((int)(x.size()))
const int p = 1e9+7;
int n,poss[201000],ans[201000];
char s[201000];
inline int calc(int a,int b){return (a+b)%p;}
inline int del(int a,int b){return (a-b+p)%p;}
inline int mul(int a,int b){return 1ll*a*b%p;}
namespace SAM{
	int cnt,last;
	int tr[401000][26],mx[401000],par[401000];
	void extand(int x,int id){
	    int np = ++cnt , p = last;
	    mx[np] = mx[p] + 1;last = np; poss[id] = np;
	    while(p && !tr[p][x]) tr[p][x] = np , p = par[p];
	    if(!p) par[np] = 1;
	    else{
	        int q = tr[p][x];
	        if(mx[q] == mx[p] + 1) par[np] = q;
	        else{
	            int nq = ++cnt;mx[nq] = mx[p] + 1;
	            rep(i,0,25) tr[nq][i] = tr[q][i];
	            par[nq] = par[q];par[q] = par[np] = nq;
	            while(p && tr[p][x] == q) tr[p][x] = nq , p = par[p];
	        }
	    }
    }	
}using namespace SAM;
namespace Tree{
	#define ls (rt<<1)
	#define rs (rt<<1|1)
	vector<int>G[401000];
	int sum1[1601000],sum2[1601000],det[1601000];
	int fa[401000],dep[401000],son[401000],sz[401000];
	int pos[401000],top[401000],tot,tmp[401000];
	void insert(int x,int y){G[x].pb(y);G[y].pb(x);}
	void dfs1(int x,int f){
		dep[x] = dep[f]+1; fa[x] = f;
		rep(i,0,SZ(G[x])-1) if(G[x][i] != f){
			int y = G[x][i];
			dfs1(y,x);
			sz[x] += sz[y];
			if(sz[y] > sz[son[x]]) son[x] = y;
		}
		sz[x]++;
	}
	void dfs2(int x){
		top[x] = son[fa[x]] == x ? top[fa[x]] : x;
		pos[x] = ++tot; tmp[tot] = x;
		if(son[x]) dfs2(son[x]);
		rep(i,0,SZ(G[x])-1) if(G[x][i] != fa[x] && G[x][i] != son[x]) 
		    dfs2(G[x][i]);
	}
	void pushdown(int rt){
		if(det[rt]){
			sum1[ls] = calc(sum1[ls] ,  mul( det[rt] , sum2[ls] ) );
			det[ls] = calc(det[ls],det[rt]);
			sum1[rs] = calc(sum1[rs] ,  mul( det[rt] , sum2[rs] ) );
			det[rs] = calc(det[rs],det[rt]);
			det[rt] = 0;
		}
	}
	void update(int rt){sum1[rt] = calc(sum1[ls],sum1[rs]);}
	void build(int rt,int l,int r){
		if(l == r){
			sum2[rt] = SAM::mx[tmp[l]] - SAM::mx[SAM::par[tmp[l]]];
			return;
		}
		int mid = (l+r)>>1;
		build(ls,l,mid); build(rs,mid+1,r);
		sum2[rt] = calc(sum2[ls],sum2[rs]);
	}
	int query(int rt,int l,int r,int x,int y){
		if(x <= l && r <= y) return sum1[rt];
		pushdown(rt);
		int mid = (l+r)>>1,ans = 0;
		if(mid >= x) ans = calc(ans,query( ls , l , mid , x , y ) );
		if(mid <  y) ans = calc(ans,query( rs , mid + 1 , r , x , y ));
		return ans;
	}
	int ask(int x,int y){
		int ans = 0;
		while(top[x] != top[y]){
			if(dep[top[x]] < dep[top[y]]) swap(x,y);
			ans = calc( ans , query( 1 , 1 , tot , pos[top[x]] , pos[x] ) );
			x = fa[top[x]];
		}
		if(dep[x] > dep[y]) swap(x,y);
		ans = calc( ans , query(1,1,tot,pos[x] , pos[y]) );
		return ans;
	}
	void add(int rt,int l,int r,int x,int y){
		if(x <= l && r <= y){
			sum1[rt] = calc(sum1[rt],sum2[rt]);
			det[rt]++;
			return;
		}
		pushdown(rt);
		int mid = (l+r)>>1;
		if(mid >= x) add(ls,l,mid,x,y);
		if(mid <  y) add(rs,mid+1,r,x,y);
		update(rt);
	}
	void add(int x,int y){
		while(top[x] != top[y]){
			if(dep[top[x]] < dep[top[y]]) swap(x,y);
			add(1,1,tot,pos[top[x]] ,pos[x]);
			x = fa[top[x]];
		}
		if(dep[x] > dep[y]) swap(x,y);
		add(1,1,tot,pos[x],pos[y]);
	}
}using namespace Tree;
int main(){
	freopen("string.in","r",stdin);
	freopen("string.out","w",stdout);
	scanf("%d",&n); scanf("%s",s+1);
	SAM::cnt = SAM::last = 1;
	rep(i,1,n) SAM::extand(s[i]-'a',i);
	rep(i,2,SAM::cnt) Tree::insert(i,SAM::par[i]);
	Tree::dfs1(1,0); Tree::dfs2(1);
	Tree::build(1,1,Tree::tot);
	rep(i,1,n){
		ans[i] = Tree::ask( 1 , poss[i] );
		ans[i] = calc(ans[i] , del( mul(2,ans[i-1]) , ans[i-2] ) );
		Tree::add( 1 , poss[i] );
		printf("%d\n",ans[i]);
	}
	return 0;
}