P2870 [USACO07DEC]Best Cow Line G（后缀数组）

题目链接：点击这里

题目大意：
给定一个长度为 $n$ 的字符串，每次只能从两边取字符，加入到答案字符串中，求字典序最小的答案字符串

题目分析：
不难想到一个贪心策略，每次把两端中字典序小的字符加到答案字符串中去，但是这只限于字母不同。
考虑如何处理两端字符相同的情况：我们设此时的左右端点为 $l,r$ ，那么就看 $l$ 从左往右看的字符串和 $r$ 从右往左看的字符串谁的字典序大即可
为了实现这个效果，只需要把原字符串反转后接到原串上，然后对新串处理个后缀数组，用 $rk$ 数组比大小即可

具体细节见代码：

// Problem: P2870 [USACO07DEC]Best Cow Line G
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P2870
// Memory Limit: 250 MB
// Time Limit: 1500 ms
// 
// Powered by CP Editor (https://cpeditor.org)

//#pragma GCC optimize(2)
//#pragma GCC optimize("Ofast","inline","-ffast-math")
//#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<unordered_map>
#define ll long long
#define inf 0x3f3f3f3f
#define Inf 0x3f3f3f3f3f3f3f3f
//#define int  ll
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
int read()
{
	int res = 0,flag = 1;
	char ch = getchar();
	while(ch<'0' || ch>'9')
	{
		if(ch == '-') flag = -1;
		ch = getchar();
	}
	while(ch>='0' && ch<='9')
	{
		res = (res<<3)+(res<<1)+(ch^48);//res*10+ch-'0';
		ch = getchar();
	}
	return res*flag;
}
const int maxn = 1e6+5;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-8;
int n,m,x[maxn<<1],y[maxn<<1],c[maxn],sa[maxn],rk[maxn],height[maxn];
char s[maxn];
void get_sa()
{
	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;i--) sa[c[x[i]]--] = i;
	for(int k = 1;k <= n;k <<= 1)
	{
		int id = 0;
		for(int i = n-k+1;i <= n;i++) y[++id] = i;
		for(int i = 1;i <= n;i++) if(sa[i] > k) y[++id] = sa[i]-k;
		for(int i = 1;i <= m;i++) c[i] = 0;
		for(int i = 1;i <= n;i++) c[x[i]]++;
		for(int i = 1;i <= m;i++) c[i] += c[i-1];
		for(int i = n;i;i--) sa[c[x[y[i]]]--] = y[i],y[i] = 0;
		swap(x,y);
		x[sa[1]] = 1,id = 1;
		for(int i = 2;i <= n;i++)
			x[sa[i]] = (y[sa[i]]==y[sa[i-1]] && y[sa[i]+k]==y[sa[i-1]+k]) ? id : ++id;
		if(id == n) break;
		m = id;
	}
}
void get_height()
{
	for(int i = 1;i <= n;i++) rk[sa[i]] = i;
	for(int i = 1,k = 0;i <= n;i++)
	{
		if(rk[i] == 1) continue;
		if(k) k--;
		int j = sa[rk[i]-1];
		while(i+k<=n && j+k<=n && s[i+k]==s[j+k]) k++;
		height[rk[i]] = k;
	}
}
int main()
{
	n = read();m = 'z';
	for(int i = 1;i <= n;i++) scanf("%s",s+i);
	for(int i = 1;i <= n;i++) s[n+i] = s[n-i+1];
	n <<= 1;
	get_sa();
	get_height();
	int l = 1,r = n/2,cnt = 0;
	while(l <= r)
	{
		if(rk[l] < rk[n-r+1]) putchar(s[l++]);
		else putchar(s[r--]);
		cnt++;
		if(cnt%80 == 0) puts("");
	}
	return 0;
}