HDU 5371 Hotaru's problem （Manacher+暴力）

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <map>
#include <time.h>
using namespace std;
const int inf = 0x3f3f3f3f;
typedef long long LL;
const double pi = acos(-1.0);
#define eps 1e-8
//#include <bits/stdc++.h>
using namespace std;
int s[110000 * 2 + 10];
int p[110000 * 2 + 10];
int main()
{
	int t, n, cas = 1;
	scanf("%d", &t);
	while (t--)
	{
		scanf("%d", &n);
		for (int i = 0; i < n; i++)
			scanf("%d", &s[i]);
		int id = 0;
		int mx = 0;
		for (int i = n; i >= 0; i--)
		{
			s[i + i + 2] = s[i];
			s[i + i + 1] = -1;
		}
		s[0] = -2;

		int ans = 0;
		for (int i = 1; i <n * 2 + 1; ++i)
		{
			if (mx > i)   //mx最长匹配
				p[i] = min(p[2 * id - i], mx - i);
			else
				p[i] = 1;
			while (s[i - p[i]] == s[i + p[i]])++p[i];
			if (p[i] + i > mx)       //update mx id
			{
				mx = p[i] + i;
				id = i;
			}
		}
		mx = 0;
		for (int i = 1; i < n * 2 + 1; i += 2)
		{
			if ((p[i] - 1) / 2 > mx)
			{
				for (int j = i + p[i] - 1;; j -= 2)
				{
					if (p[j] >= j - i)
					{
						mx = (j - i) / 2;
						break;
					}
					if ((j - i) / 2 <= mx)
						break;
				}
			}
		}
		printf("Case #%d: %d\n", cas++, mx * 3);
	}
	return 0;
}