一看题解发现竟然是枚举...
枚举最多重复子串的长度L,那么这个子串一定会覆盖s[0],s[L],s[2L],...其中相邻的两个点,然后枚举这两个点,求出这两个后缀的LCP,假设该LCP的长度为M,那么循环次数就是M / L + 1。如果不理解可以看下图:
此时L = 3,M = 3,L / M + 1 = 2,重复了2次。
但是答案的子串并不一定恰好在枚举的两个点上。我们枚举的时候,如果有M % L != 0,那么我们将该两点平移L - M % L格,再计算。
设f[L]为最多重复子串长度为L时,循环的次数,那么有:
f[L] = max(f[L], M / L + 1)
显然我们需要的答案是当f[L]取最大值时候的子串。
枚举时计算出f[L],然后找出最大值,再枚举位置,找到该串,输出即可。
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 100005, maxd = 18, inf = 0x3f3f3f3f, M = 30;
int sa[maxn], rank[maxn], height[maxn], rmq[maxn][maxd], f[maxn];
int wa[maxn], wb[maxn], wv[maxn], cnt[maxn];
void SA(int *r, int n, int m) {
int *x = wa, *y = wb;
for(int i = 0; i < m; i++) cnt[i] = 0;
for(int i = 0; i < n; i++) cnt[x[i] = r[i]]++;
for(int i = 1; i < m; i++) cnt[i] += cnt[i - 1];
for(int i = n - 1; i >= 0; i--) sa[--cnt[x[i]]] = i;
for(int j = 1; j < n; j <<= 1) {
int p = 0;
for(int i = n - j; i < n; i++) y[p++] = i;
for(int i = 0; i < n; i++) if(sa[i] >= j) y[p++] = sa[i] - j;
for(int i = 0; i < n; i++) wv[i] = x[y[i]];
for(int i = 0; i < m; i++) cnt[i] = 0;
for(int i = 0; i < n; i++) cnt[wv[i]]++;
for(int i = 1; i < m; i++) cnt[i] += cnt[i - 1];
for(int i = n - 1; i >= 0; i--) sa[--cnt[wv[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] + j] == y[sa[i] + j] ? p - 1 : p++;
if(p >= n) break;
m = p;
}
}
void calcHeight(int *r, int n) {
int i, j, k;
for(i = j = k = 0; i < n; height[rank[i++]] = k)
for(k ? k-- : 0, j = sa[rank[i] - 1]; r[i + k] == r[j + k]; k++);
}
int n, num[maxn], res[maxn];
char str[maxn];
inline int log2(int x) {
int ans = -1;
for(; x; x >>= 1) ans++;
return ans;
}
inline int query(int x, int y) {
if(x > y) swap(x, y); x++;
int k = log2(y - x + 1);
return min(rmq[x][k], rmq[y - (1 << k) + 1][k]);
}
int main() {
for(int cas = 1; ; cas++) {
scanf("%s", str); n = strlen(str);
if(n == 1 && str[0] == '#') break;
printf("Case %d: ", cas);
if(n == 1) {
printf("%c\n", str[0]);
continue;
}
for(int i = 0; i < maxn; i++) f[i] = 0;
for(int i = 0; i < n; i++) num[i] = str[i] - 'a' + 1;
num[n] = 0;
SA(num, n + 1, M);
for(int i = 0; i <= n; i++) rank[sa[i]] = i;
calcHeight(num, n);
for(int i = 2; i <= n; i++) rmq[i][0] = height[i]; rmq[1][0] = inf;
for(int j = 1; (1 << j) <= n; j++) for(int i = 1; i + (1 << (j - 1)) <= n; i++)
rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << (j - 1))][j - 1]);
int t = n >> 1;
for(int i = 1; i < t; i++) {
int len = (n - 1) / i;
for(int j = 0; j < len; j++) {
int x = j * i, y = (j + 1) * i, z = query(rank[x], rank[y]);
f[i] = max(f[i], z / i + 1);
if(z % i) {
z = query(rank[x - (i - z % i)], rank[y - (i - z % i)]);
f[i] = max(f[i], z / i + 1);
}
}
}
int ans = 0, tot = 0;
for(int i = 1; i < t; i++) ans = max(ans, f[i]);
for(int i = 1; i < t; i++) if(ans == f[i]) res[tot++] = i;
bool flag = 1;
for(int i = 1; i <= n && flag; i++) for(int j = 0; j < tot && flag; j++) {
int x = sa[i];
if(x + res[j] >= n) continue;
int z = query(rank[x], rank[x + res[j]]);
if(z >= (ans - 1) * res[j]) {
flag = 0;
for(int k = x; k < x + ans * res[j]; k++)
printf("%c", str[k]);
printf("\n");
}
}
}
return 0;
}