版权声明:本文为博主原创文章,转载请预先通知博主(〃'▽'〃)。 https://blog.csdn.net/m0_37624640/article/details/82913302
- 字符串正式入坑……看了2天后缀数组,发明这个东西的人真是脑洞超级大 ORZ
- 推荐一下个人认为不错的讲解博客:
- 后缀数组详解
- 后缀数组——罗穗骞倍增算法代码详解
AC代码:
#include<bits/stdc++.h>
#define IO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define pb(x) push_back(x)
#define sz(x) (int)(x).size()
#define sc(x) scanf("%d",&x)
#define pr(x) printf("%d\n",x)
#define abs(x) ((x)<0 ? -(x) : x)
#define all(x) x.begin(),x.end()
#define mk(x,y) make_pair(x,y)
#define debug printf("!!!!!!\n")
#define fin freopen("in.txt","r",stdin)
#define fout freopen("out.txt","w",stdout)
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
const int mod = 1e9+7;
const double PI = 4*atan(1.0);
const int maxm = 1e6;
const int maxn = 1e6+5;
const int INF = 0x3f3f3f3f;
const ll LINF = 1ll<<62;
const int m = 128; //ascII码[0,127]
char s[maxn];
int sa[maxn],t[maxn],t2[maxn],c[maxn],n;
void build_sa(int m)
{
int *x = t,*y = t2;
for(int i=0;i<m;i++) c[i] = 0;
for(int i=0;i<n;i++) c[x[i] = s[i]]++;
for(int i=1;i<m;i++) c[i]+=c[i-1];
for(int i=n-1;i>=0;i--) sa[--c[x[i]]] = i;
for(int k=1;k<=n;k<<=1)
{
int p = 0;
for(int i = n-k;i<n;i++) y[p++] = i;
for(int i=0;i<n;i++) if(sa[i]>=k) y[p++] = sa[i]-k;
for(int i=0;i<m;i++) c[i] = 0;
for(int i=0;i<n;i++) c[x[y[i]]]++;
for(int i=1;i<m;i++) c[i]+=c[i-1];
for(int i=n-1;i>=0;i--) sa[--c[x[y[i]]]] = y[i];
swap(x,y);
p = 1;x[sa[0]] = 0;
for(int i=1;i<n;i++)
x[sa[i]] = (y[sa[i-1]] == y[sa[i]] && y[sa[i-1]+k] == y[sa[i]+k])?p-1:p++;
if(p>=n) break;
m = p;
}
}
int main()
{
#ifdef LOCAL_FILE
freopen("in.txt","r",stdin);
#endif // LOCAL_FILE
scanf("%s",s);
n = strlen(s);
build_sa(m);
for(int i=0;i<n;i++) printf("%d ",sa[i]+1);
printf("\n");
return 0;
}