#include<stdio.h>
#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
char qdu[100005];
int qqq,www;
void manachar()
{
int i;
int res = 0;
for (i = 0;qdu[i];i++)
{
int l = i;
int r = i;
while (qdu[i] == qdu[r + 1])r++;
i = r;
while (qdu[l - 1] == qdu[r + 1]) { r++;l--; }
if (res < r - l + 1)
{
res = r - l + 1;
qqq = l;
www = r;
}
}
}
int main()
{
string q;
while (cin >> q)
{
if (q.size() == 1)
{
cout << q;
cout << endl;
continue;
}
memset(qdu, 0, sizeof(qdu));
for (int a = 0;a < q.size();a++)
{
qdu[a + 1] = q[a];
}
qdu[0] = '$';
manachar();
if (qqq - www == 0)
{
cout << qdu[1] << endl;
continue;
}
for (int a = qqq;a <= www;a++)cout << qdu[a];
cout << endl;
}
return 0;
}
ural 1297 康神无敌马拉车
最新推荐文章于 2019-01-20 14:00:04 发布