Jzoj4384 Hashit

#pragma GCC opitmize("O3")
#pragma G++ opitmize("O3")
#include<set>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define LL long long
using namespace std;
char s[100010]; int n=0;
LL h[100010],bas[100010]={1};
struct suffix{ int x; };
inline LL gH(int l,int r){ return h[r]-h[l-1]*bas[r-l+1]; }
inline int lcp(int x,int y){
if(x==y) return 0;
int l=-1,r=min(x,y)-1;
for(int m;l<r;){
m=l+r+1>>1;
if(gH(x-m,x)==gH(y-m,y)) l=m;
else r=m-1;
}
return l+1;
}
inline bool operator< (suffix a,suffix b){
int c=lcp(a.x,b.x); return s[a.x-c]<s[b.x-c];
}
multiset<suffix> w;
multiset<suffix>::iterator c[100010],p,q;
int main(){
int ans=0;
for(int i=1;i<=100000;++i) bas[i]=bas[i-1]*27;
for(char o;;){
o=getchar();
if(o=='-'){
p=q=c
; ++p; --q;
ans-=n-lcp(p->x,n)-lcp(n,q->x)+(p->x==n || q->x==n?0:lcp(p->x,q->x));
w.erase(c[n--]);
}
else if(o>='a' && o<='z'){
s[++n]=o;  h
=h[n-1]*27+o-'a';
p=q=c
=w.insert((suffix){n}); ++p; --q;
ans+=n-lcp(p->x,n)-lcp(n,q->x)+(p->x==n || q->x==n?0:lcp(p->x,q->x));
} else break;
printf("%d\n",ans);
}
}