BZOJ1031: [JSOI2007]字符加密Cipher

传送门

后缀数组模板题

 //BZOJ 1031
 //by Cydiater
 //2016.9.21
 #include <iostream>
 #include <cstring>
 #include <string>
 #include <algorithm>
 #include <queue>
 #include <map>
 #include <ctime>
 #include <cstdlib>
 #include <iomanip>
 #include <cstdio>
 #include <cmath>
 using namespace std;
 #define ll long long
 #define up(i,j,n)        for(int i=j;i<=n;i++)
 #define down(i,j,n)        for(int i=j;i>=n;i--)
 ;
 const int oo=0x3f3f3f3f;
 inline int read(){
     ,f=;
     ;ch=getchar();}
     +ch-';ch=getchar();}
     return x*f;
 }
 char s[MAXN];
 int sa[MAXN],p[MAXN],tmp[MAXN],rank[MAXN],N,cnt[MAXN];
 namespace solution{
     inline bool equ(int x,int y,int l){return rank[x]==rank[y]&&rank[x+l]==rank[y+l];}
     void init(){
         scanf();
         N=strlen(s+);
         up(i,,N)s[i+N]=s[i];
         N<<=;
     }
     void suffix_sort(){
         up(i,,N){sa[i]=i;rank[i]=s[i];}
         ,sig=,l=;pos<N;sig=pos){
             ,i=N-l+;i<=N;i++)p[++pos]=i;
             ;i<=N;i++)if(sa[i]>l)p[++pos]=sa[i]-l;
             ;i<=sig;i++)cnt[i]=;
             ;i<=N;i++)cnt[rank[i]]++;
             ;i<=sig;i++)cnt[i]+=cnt[i-];
             for(i=N;i;i--)sa[cnt[rank[p[i]]]--]=p[i];
             ,pos=;i<=N;i++)tmp[sa[i]]=equ(sa[i],sa[i-],l)?pos:++pos;
             ;i<=N;i++)rank[i]=tmp[i];
             l=!l?:l<<;
         }
     }
     void slove(){
         suffix_sort();
         up(i,,N)){
             printf(-]);
         }
     }
 }
 int main(){
     //freopen("input.in","r",stdin);
     using namespace solution;
     init();
     slove();
     ;
 }