很容易发现是贪心,问题在于如果两个字符相等时我们要继续向下比较,这样最坏是O(n^2)的,可以通过BZOJ1640。
然后我们就需要一个快速比较字典序的工具了,后缀数组可以。
好久没敲,板都快忘了。
/* Telekinetic Forest Guard */
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 60005;
int sa[maxn], rank[maxn], height[maxn];
int wa[maxn], wb[maxn], wv[maxn], cnt[maxn];
inline 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 < m; i++) cnt[i] = 0;
for(int i = 0; i < n; i++) cnt[wv[i] = x[y[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;
}
}
inline void getHeight(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, len, num[maxn];
char str[maxn];
int main() {
scanf("%d", &len); n = (len << 1) + 1;
for(int i = 0; i < len; i++) {
char ch = getchar(); for(; ch < 'A' || ch > 'Z'; ch = getchar());
str[n - i - 1] = str[i] = ch;
}
for(int i = 0; i < n; i++) num[i] = str[i] - 'A' + 1;
num[len] = 28;
num[n] = 0;
SA(num, n + 1, 30);
for(int i = 1; i <= n; i++) rank[sa[i]] = i;
getHeight(num, n);
int l = 0, r = len + 1, tim = 0;
while(n - l - 1 >= r) {
if(num[l] < num[r]) printf("%c", str[l++]);
else if(num[l] > num[r]) printf("%c", str[r++]);
else if(rank[l] < rank[r]) printf("%c", str[l++]);
else printf("%c", str[r++]);
if(!(++tim % 80)) printf("\n");
}
return 0;
}