# [SPOJ 705] New Distinct Substrings

maya，一不小心就看到题解了，ppfish大爷的题解

// SPOJ 1705

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <vector>
#include <utility>
#include <stack>
#include <queue>
#include <iostream>
#include <algorithm>

{
char c; int flag = 1;
while((c = getchar()) < '0' || c > '9')
if(c == '-') flag *= -1;
x = c - '0';
while((c = getchar()) >= '0' && c <= '9')
x = (x<<3) + (x<<1) + (c-'0');
x *= flag;
return;
}
template<class Num>void write(Num x)
{
if(x < 0) putchar('-'), x = -x;
static char s[20];int sl = 0;
while(x) s[sl++] = x%10 + '0',x /= 10;
if(!sl) {putchar('0');return;}
while(sl) putchar(s[--sl]);
}

const int maxn = 50020;
char s[maxn];
int n, sa[maxn], rank[maxn];
int c[maxn], height[maxn];
long long ans;

void build_sa(int m)
{
static int t0[maxn], t1[maxn];
int *x = t0, *y = t1;

for(int i = 1; i <= m; i++) c[i] = 0;
for(int i = 1; i <= n; i++) c[x[i] = s[i]]++;
for(int i = 1; i <= m; i++) c[i] += c[i - 1];
for(int i = n; i >= 1; i--) sa[c[x[i]]--] = i;

for(int k = 1; k <= n; k <<= 1)
{
int p = 0;
for(int i = 0; i < k; i++) y[++p] = n - i;
for(int i = 1; i <= n; i++)
if(sa[i] > k) y[++p] = sa[i] - k;
for(int i = 1; i <= m; i++) c[i] = 0;
for(int i = 1; i <= n; i++) c[x[y[i]]]++;
for(int i = 1; i <= m; i++) c[i] += c[i - 1];
for(int i = n; i >= 1; i--) sa[c[x[y[i]]]--] = y[i];
std::swap(x, y), x[sa[p = 1]] = 1;
for(int i = 2; i <= n; i++)
x[sa[i]] = y[sa[i]] == y[sa[i - 1]] && sa[i] + k <= n && sa[i - 1] + k <= n && y[sa[i] + k] == y[sa[i - 1] + k] ? p : ++p;
if(p == n) break;
m = p;
}
}
void build_height()
{
int k = 0;
for(int i = 1; i <= n; i++) rank[sa[i]] = i;
for(int i = 1; i <= n; i++)
{
if(k != 0) k--;
if(rank[i] == 1) continue;
int j = sa[rank[i] - 1];
while(s[i + k] == s[j + k]) k++;
height[rank[i]] = k;
}
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("subst1.in","r",stdin);
freopen("subst1.out","w",stdout);
#endif

scanf("%s", s + 1);
n = strlen(s + 1);
build_sa(256);
build_height();

ans = (long long)n*(n + 1)>>1;
for(int i = 1; i <= n; i++)
ans -= height[i];
write(ans);

#ifndef ONLINE_JUDGE
fclose(stdin);
fclose(stdout);
#endif
return 0;
}

• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120