「JSOI2007」字符加密 后缀数组（SA）

字符加密

题目大意：寻找最小的循环移动位置

解题思路：
后缀数组模板题，将字符串 S复制一份，接在S后面变成 SS 就转化成了后缀排序问题，每个字符串的最后一个字符对应的就是s[sa[i]+n-1]，然后跑一下模板就odk。

Code：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#define mk makr_pair
#define ll long long
using namespace std;
inline int read()
{
  int x=0,f=1;char ch=getchar();
  while (!isdigit(ch)) {if (ch=='-') f=-1;ch=getchar();}
  while (isdigit(ch)) {x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
  return x*f;
}
const int maxn = 2e6+1e2;
int rk[maxn],wb[maxn],sa[maxn];
int tmp[maxn],h[maxn],height[maxn];
int n;
char a[maxn];
void getsa()
{
 int *x =rk,*y=tmp;
 int s = 128;
 for (int i=1;i<=n;i++) x[i]=a[i],y[i]=i;
 for (int i=1;i<=s;i++) wb[i]=0;
 for (int i=1;i<=n;i++) wb[x[y[i]]]++;
 for (int i=1;i<=s;i++) wb[i]+=wb[i-1];
 for (int i=n;i>=1;i--) sa[wb[x[y[i]]]--]=y[i];
 int p =0;
 for (int j=1;p<n;j<<=1)
 {
  p=0;
  for (int i=n-j+1;i<=n;i++) y[++p]=i;
  for (int i=1;i<=n;i++) if (sa[i]>j) y[++p] = sa[i]-j;
  for (int i=1;i<=s;i++) wb[i]=0;
  for (int i=1;i<=n;i++) wb[x[y[i]]]++;
  for (int i=1;i<=s;i++) wb[i]+=wb[i-1];
     for (int i=n;i>=1;i--) sa[wb[x[y[i]]]--]=y[i];
  swap(x,y);
  p=1;
  x[sa[1]]=1;
  for (int i=2;i<=n;i++)
  {
   x[sa[i]] = (y[sa[i]]==y[sa[i-1]] && y[sa[i]+j]==y[sa[i-1]+j]) ? p : ++p; 
   } 
   s=p;
 }
 for (int i=1;i<=n;i++) rk[sa[i]]=i;
 h[0]=0;
    for (int i=1;i<=n;i++)
 {
  h[i]=max(h[i-1]-1,0);
  while(i+h[i]<=n && sa[rk[i]-1]+h[i]<=n && a[i+h[i]]==a[sa[rk[i]-1]+h[i]]) h[i]++;
 } 
 for (int i=1;i<=n;i++) height[i]=h[sa[i]];
}
/*
void getsa()
{
	
	int *x =rk,*y=tmp;
	int s = 128;
	for (int i=1;i<=n;i++) x[i]=a[i],y[i]=i;
	for (int i=1;i<=s;i++) wb[i]=0;
	for (int i=1;i<=n;i++) wb[x[y[i]]]++;
	for (int i=1;i<=s;i++) wb[i]+=wb[i-1];
	for (int i=n;i>=1;i--) sa[wb[x[y[i]]]--]=y[i];
	int p =0;
	for (int j=1;p<n;j<<=1){
		p=0;
		for (int i=n-j+1;i<=n;i++) y[++p]=i;
		for (int i=1;i<=n;i++) if (sa[i]>j) y[++p] = sa[i]-j;
		for (int i=1;i<=s;i++) wb[i]=0;
		for (int i=1;i<=n;i++) wb[x[y[i]]]++;
		for (int i=1;i<=s;i++) wb[i]+=wb[i-1];
    	for (int i=n;i>=1;i--) sa[wb[x[y[i]]]--]=y[i];
		swap(x,y);
		p=1;
		x[sa[1]]=1;
		for (int i=2;i<=n;i++){
			x[sa[i]] = (y[sa[i]]==y[sa[i-1]] && y[sa[i]+j]==y[sa[i-1]+j]) ? p : ++p; 
		} 
		s=p;
 	}
	for (int i=1;i<=n;i++) rk[sa[i]]=i;
	h[0]=0;
    for (int i=1;i<=n;i++){
		h[i]=max(h[i-1]-1,0);
		while(i+h[i]<=n && sa[rk[i]-1]+h[i]<=n && a[i+h[i]]==a[sa[rk[i]-1]+h[i]]) h[i]++;
	} 
	for (int i=1;i<=n;i++) height[i]=h[sa[i]];
}
*/
int main()
{
  scanf("%s",a+1);
  n=strlen(a+1);
  for (int i=1;i<=n;i++) a[i+n]=a[i];
  n<<=1;
  getsa();
  for (int i=1;i<=n;i++) if (sa[i]<=n/2) cout<<a[sa[i]+n/2-1];
  cout<<endl;
  
  return 0;
}