-
Notifications
You must be signed in to change notification settings - Fork 0
/
ural1297.cpp
120 lines (110 loc) · 2.72 KB
/
ural1297.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAX_N = 20007;
int sa[MAX_N], wa[MAX_N], wb[MAX_N], ws[MAX_N], rank[MAX_N], height[MAX_N];
struct Suffix {
int cmp(int *r, int a, int b, int d) {
return r[a] == r[b] && r[a + d] == r[b + d];
}
void DA(int *r, int *sa, int n, int m) {
int *x = wa, *y = wb;
for (int i = 0; i < m; ++i) ws[i] = 0;
for (int i = 0; i < n; ++i) ++ws[x[i] = r[i]];
for (int i = 1; i < m; ++i) ws[i] += ws[i - 1];
for (int i = n - 1; i >= 0; --i) sa[--ws[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) ws[i] = 0;
for (int i = 0; i < n; ++i) ++ws[x[y[i]]];
for (int i = 1; i < m; ++i) ws[i] += ws[i - 1];
for (int i = n - 1; i >= 0; --i) sa[--ws[x[y[i]]]] = y[i];
swap(x, y);
p = 1, x[sa[0]] = 0;
for (int i = 1; i < n; ++i) x[sa[i]] = cmp(y, sa[i - 1], sa[i], k) ? p - 1 : p++;
if (p >= n) break;
m = p;
}
}
void calheight(int *r, int *sa, int n) {
for (int i = 1; i <= n; ++i) rank[sa[i]] = i;
for (int i = 0, k = 0; i < n; ++i) {
if (k) --k;
int j = sa[rank[i] - 1];
while (i + k < n && j + k < n && r[i + k] == r[j + k]) ++k;
height[rank[i]] = k;
}
}
};
int RMQ[MAX_N], mm[MAX_N], best[13][MAX_N];
void initRMQ(int n) {
mm[0] = -1;
for (int i = 1; i <= n; ++i) {
mm[i] = ((i & (i - 1)) == 0) ? mm[i - 1] + 1 : mm[i - 1];
}
for (int i = 1; i <= n; ++i) {
best[0][i] = i;
}
for (int i = 1; i <= mm[n]; ++i) {
for (int j = 1; j + (1 << i) - 1 <= n; ++j) {
int a = best[i - 1][j];
int b = best[i - 1][j + (1 << (i - 1))];
if (RMQ[a] < RMQ[b]) best[i][j] = a;
else best[i][j] = b;
}
}
}
int query(int a, int b) {
int t = mm[b - a + 1];
b -= (1 << t) - 1;
a = best[t][a], b = best[t][b];
return RMQ[a] < RMQ[b] ? a : b;
}
int lcp(int a, int b) {
a = rank[a], b = rank[b];
if (a > b) swap(a, b);
return height[query(a + 1, b)];
}
char str[MAX_N];
int d[MAX_N];
int main() {
scanf("%s", str);
int len = (int) strlen(str);
str[len] = '#';
for (int i = len - 1; i >= 0; --i) {
str[2 * len - i] = str[i];
}
int n = len * 2 + 1;
for (int i = 0; i < n; ++i) {
d[i] = str[i];
}
d[n] = 0;
Suffix ans;
ans.DA(d, sa, n + 1, 128);
ans.calheight(d, sa, n);
for (int i = 1; i <= n; ++i) {
RMQ[i] = height[i];
}
initRMQ(n);
int Max = 0, idx = 0;
for (int i = 0; i < len; ++i) {
int x = lcp(i, n - i - 1);
if (2 * x - 1 > Max) {
Max = 2 * x - 1;
idx = i - x + 1;
}
x = lcp(i, n - i);
if (2 * x > Max) {
Max = 2 * x;
idx = i - x;
}
}
for (int i = idx; i < Max + idx; ++i) {
printf("%c", str[i]);
}
puts("");
return 0;
}