BZOJ2342【manacher】【set】

最新推荐文章于 2018-12-09 19:37:52 发布

Lethelody

最新推荐文章于 2018-12-09 19:37:52 发布

阅读量427

点赞数

分类专栏：字符串 STL

本文链接：https://blog.csdn.net/Lethelody/article/details/45691001

版权

字符串同时被 2 个专栏收录

15 篇文章 0 订阅

订阅专栏

STL

11 篇文章 0 订阅

订阅专栏

/* I will wait for you*/

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <string>
#define make make_pair
#define fi first
#define se second

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;

const int maxn = 1000010;
const int maxm = 1010;
const int maxs = 26;
const int inf = 0x3f3f3f3f;
const int P = 1000000007;
const double error = 1e-9;

inline int read()
{
	int x = 0, f = 1; char ch = getchar();
	while (ch <= 47 || ch >= 58)
		f = (ch == 45 ? -1 : 1), ch = getchar();
	while (ch >= 48 && ch <= 57)
		x = x * 10 + ch - 48, ch = getchar();
	return x * f;
}

int n, pos, ans, mx[maxn], y[maxn];
char s[maxn]; set<int> m;

void manacher()
{  
	for (int i = 0; i <= n; i++) {
		if (pos + mx[pos] >= i)
			mx[i] = min(mx[2 * pos - i], pos + mx[pos] - i);
		for(;i - mx[i] - 1 >= 0 && i + mx[i] + 1 <= n && 
		     s[i - mx[i] -1 ] == s[i + mx[i] + 1]; mx[i]++);
		if (i + mx[i] > pos + mx[pos])
			pos = i;
	}
}			

bool cmp (int a, int b)
{
	return a - mx[a] < b - mx[b];
}

int main()
{
	n = read(), scanf("%s", s + 1);

	for (int i = n; i >= 1; i--)
		s[2 * i - 1] = s[i];
	for (int i = 0; i <= 2 * n; i += 2)
		s[i] = '#';
	n *= 2, manacher(), n /= 2;

	for (int i = 1; i <= n; i++)
		y[i] = i, mx[i] = mx[2 * i] / 2;
	sort(y + 1, y + 1 + n, cmp);

	for (int i = 1, j = 1; i <= n; i++) {
		for (; j <= n && y[j] - mx[y[j]] <= i; j++)
			m.insert(y[j]);
		set<int> :: iterator pos = m.upper_bound(i + mx[i] / 2);
		if (pos != m.begin())
			ans = max(ans, 4 * (*--pos - i));
	}
	
	printf("%d\n", ans);		

	return 0;
}