From Evernote:

uva 719

另類的後綴數組

[sourcecode language="cpp"]
//============================================================================
// Name : Glass Beads.cpp
// Date : 2013 2013/2/3 下午1:25:50
// Author : GCA
//============================================================================
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
printf("%d ",dp[htx][hty]);}Pln();}
#define M 10005
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
struct suffixarray{
static const int mx=10005;
int ra[mx],tra[mx],sa[mx],tsa[mx],c[mx];
char str[mx];
int n;
void sort(int k){
Set(c,0);
for(int i=0;i<n;i++)c[ra[(i+k)%n]]++;
int s=0;
for(int i=0;i<max(128,n);i++){
int t=c[i];
c[i]=s;
s+=t;
}
for(int i=0;i<n;i++){
tsa[c[ra[(sa[i]+k)%n]]++]=sa[i];
}
memcpy(sa,tsa,sizeof(sa));

}
void build(){
n=strlen(str);
for(int i=0;i<n;i++){
ra[i]=str[i];
sa[i]=i;
}
for(int k=1;k<n;k*=2){
// for(int i=0;i<n;i++)printf("%d",sa[i]);Pln();
sort(k);
sort(0);
int r=tra[sa[0]]=0;
for(int i=1;i<n;i++){
int s1=sa[i],s2=sa[i-1];
bool b=true;
b&=ra[s1]==ra[s2];
b&=ra[(s1+k)%n]==ra[(s2+k)%n];
tra[sa[i]]=b?r:++r;
}
memcpy(ra,tra,sizeof(ra));
}
}
};

//char str[M];
int main() {
ios_base::sync_with_stdio(0);
int test;
scanf("%d",&test);

while(test--){
suffixarray in;
scanf("%s",in.str);
in.build();
printf("%d\n",in.sa[0]+1);
}

}

[/sourcecode]