BZOJ3277 串 【后缀数组】【二分答案】【主席树】

题目分析：

用"$"连接后缀数组，然后做一个主席树求区间内不同的数的个数。二分一个前缀长度再在主席树上求不同的数的个数。

代码:

 #include<bits/stdc++.h>
 using namespace std;

 const int maxn = ;
 const int N = ;

 int m,n,k;
 string hmk[maxn],str;
 int sum[maxn];

 int sa[maxn],rk[maxn],X[maxn],Y[maxn];
 int height[maxn],h[maxn],RMQ[maxn][],Tnum;
 long long ans[maxn];

 struct node{
     int ch[],sum;
 }CMT[maxn*];

 int chk(int x,int k){
     return rk[sa[x]]==rk[sa[x-]]&&rk[sa[x]+(<<k)]==rk[sa[x-]+(<<k)];
 }

 void getsa(){
     for(int i=;i<n;i++) X[str[i]]++;
     for(int i=;i<=N;i++) X[i] += X[i-];
     for(int i=n-;i>=;i--) sa[X[str[i]]--] = i;
     for(int i = , num = ;i <= n;i++)
     rk[sa[i]] = (str[sa[i]] == str[sa[i-]]?num:++num);
     rk[sa[]] = ;
     for(int k=;(<<k-)<=n;k++){
     for(int i=;i<=N;i++) X[i] = ;
     for(int i=n-(<<k-);i<n;i++) Y[i-n+(<<k-)+]=i;
     for(int i=,j=(<<k-)+;i<=n;i++)
         if(sa[i]>=(<<k-))Y[j++]=sa[i]-(<<k-);
     for(int i=;i<n;i++) X[rk[i]]++;
     for(int i=;i<=N;i++) X[i]+=X[i-];
     for(int i=n;i>=;i--) sa[X[rk[Y[i]]]--] = Y[i];
     int num = ; Y[sa[]] = ;
     for(int i=;i<=n;i++) Y[sa[i]] = (chk(i,k-)?num:++num);
     for(int i=;i<n;i++) rk[i] = Y[i];
     if(num == n) break;
     }
 }
 void getheight(){
     for(int i=;i<n;i++){
     if(i) h[i] = max(,h[i-]-); else h[i] = ;
     if(rk[i] == ) continue;
     int comp = sa[rk[i]-];
     while(str[comp+h[i]] == str[i+h[i]])h[i]++;
     }
     for(int i=;i<n;i++) height[rk[i]] = h[i];
     for(int i=;i<=n;i++) RMQ[i][] = height[i];
     for(int k=;(<<k)<=n;k++){
     for(int i=;i<=n;i++){
         if(i+(<<k-)>n) RMQ[i][k]=RMQ[i][k-];
         else RMQ[i][k] = min(RMQ[i][k-],RMQ[i+(<<k-)][k-]);
     }
     }
 }

 int pww[maxn];
 int getLCP(int L,int R){
     if(L == R) return n-sa[L];
     L++;
     int k = pww[R-L+];
     return min(RMQ[L][k],RMQ[R-(<<k)+][k]);
 }

 void build_empty_tree(int now,int tl,int tr){
     if(tl == tr) return;
     int mid = (tl+tr)/;
     Tnum++; CMT[now].ch[] = Tnum;
     build_empty_tree(Tnum,tl,mid);
     Tnum++; CMT[now].ch[] = Tnum;
     build_empty_tree(Tnum,mid+,tr);
 }

 void Modify(int lst,int now,int tl,int tr,int pos,int dt){
     CMT[now] = CMT[lst];
     if(tl == tr){CMT[now].sum += dt;}
     else{
     int mid = (tl+tr)/;
     if(pos <= mid){
         CMT[now].ch[] = ++Tnum;
         Modify(CMT[lst].ch[],Tnum,tl,mid,pos,dt);
     }else{
         CMT[now].ch[] = ++Tnum;
         Modify(CMT[lst].ch[],Tnum,mid+,tr,pos,dt);
     }
     CMT[now].sum += dt;
     }
 }

 int imp[maxn],his[maxn];
 void build_CMT(){
     his[] = ;
     for(int i=;i<=n;i++){
     if(imp[sum[sa[i]]]){
         int z = ++Tnum;
         Modify(his[i-],z,,n,imp[sum[sa[i]]],-);
         his[i] = ++Tnum; imp[sum[sa[i]]] = i;
         Modify(z,his[i],,n,i,);
     }else{
         his[i] = ++Tnum; imp[sum[sa[i]]] = i;
         Modify(his[i-],his[i],,n,i,);
     }
     }
 }

 int query(int now,int tl,int tr,int l,int r){
     if(tl >= l && tr <= r) return CMT[now].sum;
     if(tl > r || tr < l) return ;
     int mid = (tl+tr)/;
     int as=query(CMT[now].ch[],tl,mid,l,r)+query(CMT[now].ch[],mid+,tr,l,r);
     return as;
 }

 int rgt[maxn];
 void work(){
     getsa();
     getheight();
     sum[n] = ;rgt[n] = n;
     for(int i=n-;i>=;i--){
     sum[i] = sum[i+]+(str[i] == '$');
     if(str[i] == '$') rgt[i] = i;
     else rgt[i] = rgt[i+];
     }
     Tnum = ;
     build_empty_tree(,,n);
     build_CMT();
     for(int i=m;i<=n;i++){
     int l = ,r = rgt[sa[i]]-sa[i];
     while(l < r){
         int mid = (l+r+)/;
         int al = ,ar = i;
         while(al < ar){
         int midd = (al+ar)/;
         if(getLCP(midd,i) >= mid) ar = midd;
         else al = midd+;
         }
         int tl  = i,tr = n;
         while(tl < tr){
         int midd = (tl+tr+)/;
         if(getLCP(i,midd) >= mid) tl = midd;
         else tr = midd-;
         }
         int mmp = query(his[tl],,n,al,tl);
         if(mmp >= k) l = mid;
         else r = mid-;
     }
     ans[m-sum[sa[i]]+] += l;
     }
     for(int i=;i<=m;i++) printf("%lld ",ans[i]);
 }

 int main(){
     ios::sync_with_stdio(false);
     cin.tie();
     cin >> m >> k;
     for(int i=;i<=m;i++) cin >> hmk[i];
     for(int i=;i<m;i++) str += hmk[i],str += '$';
     str += hmk[m];
     n = str.length();
     pww[] = ;
     for(int i=;i<=n;i++) pww[i] = pww[i/]+;
     work();
     return ;
 }