传送门
题解:
这个做法在离线情况下可以做到 O ( 26 n + n log n ) O(26n+n\log n) O(26n+nlogn),强制在线可能会被卡成 O ( n n ) O(n\sqrt n) O(nn),但是由于不用哈希,常数会比后缀平衡树做法小一点。
首先建立广义SAM,那么某个时刻的答案实际上就是此时所有串在SAM上的节点到根节点的链的并,直接利用DFS序树上差分算一下答案即可。
代码:
#include<bits/stdc++.h>
#define ll long long
#define re register
#define cs const
using std::cerr;
using std::cout;
cs int N=2e5+7;
char s[N];int n;
int ps[N];
namespace SAM{
cs int N=::N;
int son[N][26],fa[N],len[N],now=1;
inline int push_back(int p,int c){
int cur=++now;len[cur]=len[p]+1;
for(;p&&!son[p][c];p=fa[p])son[p][c]=cur;
if(!p)fa[cur]=1;
else if(len[son[p][c]]==len[p]+1)fa[cur]=son[p][c];
else {
int nq=++now,q=son[p][c];
memcpy(son[nq],son[q],sizeof son[q]);
len[nq]=len[p]+1;fa[nq]=fa[q];fa[q]=fa[cur]=nq;
for(;p&&son[p][c]==q;p=fa[p])son[p][c]=nq;
}
return cur;
}
int el[N],nxt[N];
int siz[N],ch[N],top[N],d[N],in[N],dfn[N],dfc;
void dfs1(int u){
siz[u]=1;d[u]=d[fa[u]]+1;
for(int re v=el[u];v;v=nxt[v])
dfs1(v),siz[u]+=siz[v],(siz[v]>siz[ch[u]])&&(ch[u]=v);
}
void dfs2(int u,int tp){
dfn[in[u]=++dfc]=u;top[u]=tp;
for(int re v=el[u];v;v=nxt[v])dfs2(v,ch[u]==v?tp:v);
}
inline void tree_dissection(){
for(int re i=2;i<=now;++i)nxt[i]=el[fa[i]],el[fa[i]]=i;
dfs1(1),dfs2(1,1);
}
inline int LCA(int u,int v){
while(top[u]!=top[v])d[top[u]]<d[top[v]]?v=fa[top[v]]:u=fa[top[u]];
return d[u]<d[v]?u:v;
}
std::set<int> s;ll ans;
typedef std::set<int>::iterator iter;
inline void ins(int u){
iter t=s.insert(in[u]).first;
ans+=len[u];iter l=t,r=t;
if(t!=s.begin()){--l,ans-=len[LCA(u,dfn[*l])];}
if(t!=--s.end()){++r,ans-=len[LCA(u,dfn[*r])];}
if(l!=t&&r!=t)ans+=len[LCA(dfn[*l],dfn[*r])];
}
inline void del(int u){
iter t=s.find(in[u]);
ans-=len[u];iter l=t,r=t;
if(t!=s.begin()){--l;ans+=len[LCA(u,dfn[*l])];}
if(t!=--s.end()){++r;ans+=len[LCA(u,dfn[*r])];}
if(l!=t&&r!=t)ans-=len[LCA(dfn[*l],dfn[*r])];
s.erase(t);
}
}
namespace Trie{
cs int N=::N;
int son[N][26],ps[N],now=1;
inline int trans(int p,int c){
if(son[p][c])return son[p][c];
else return son[p][c]=++now;
}
int q[N],qn;
inline void build_SAM(){
q[qn=1]=1;ps[1]=1;
for(int re i=1;i<=qn;++i){
int u=q[i];for(int re c=0;c<26;++c)
if(son[u][c])q[++qn]=son[u][c],ps[son[u][c]]=SAM::push_back(ps[u],c);
}
}
}
int st[N];
signed main(){
#ifdef zxyoi
freopen("hashit.in","r",stdin);
#endif
scanf("%s",s+1);n=strlen(s+1);
ps[0]=st[0]=1;
for(int re i=1,tp=0;i<=n;++i){
if(s[i]=='-')--tp;
else st[tp+1]=ps[i]=Trie::trans(st[tp],s[i]-'a'),++tp;
}
Trie::build_SAM();
SAM::tree_dissection();
for(int re i=1;i<=n;++i)if(ps[i])ps[i]=Trie::ps[ps[i]];
for(int re i=1,tp=0;i<=n;++i){
if(s[i]=='-')SAM::del(st[tp--]);
else SAM::ins(st[++tp]=ps[i]);
cout<<SAM::ans<<"\n";
}
return 0;
}