URAL 1279 Palindrome

The “U.S. Robots” HQ has just received a rather alarming anonymous letter. It states that the agent from the competing «Robots Unlimited» has infiltrated into “U.S. Robotics”. «U.S. Robots» security service would have already started an undercover operation to establish the agent’s identity, but, fortunately, the letter describes communication channel the agent uses. He will publish articles containing stolen data to the “Solaris” almanac. Obviously, he will obfuscate the data, so “Robots Unlimited” will have to use a special descrambler (“Robots Unlimited” part number NPRx8086, specifications are kept secret).
Having read the letter, the “U.S. Robots” president recalled having hired the “Robots Unlimited” ex-employee John Pupkin. President knows he can trust John, because John is still angry at being mistreated by “Robots Unlimited”. Unfortunately, he was fired just before his team has finished work on the NPRx8086 design.
So, the president has assigned the task of agent’s message interception to John. At first, John felt rather embarrassed, because revealing the hidden message isn’t any easier than finding a needle in a haystack. However, after he struggled the problem for a while, he remembered that the design of NPRx8086 was still incomplete. “Robots Unlimited” fired John when he was working on a specific module, the text direction detector. Nobody else could finish that module, so the descrambler will choose the text scanning direction at random. To ensure the correct descrambling of the message by NPRx8086, agent must encode the information in such a way that the resulting secret message reads the same both forwards and backwards.
In addition, it is reasonable to assume that the agent will be sending a very long message, so John has simply to find the longest message satisfying the mentioned property.
Your task is to help John Pupkin by writing a program to find the secret message in the text of a given article. As NPRx8086 ignores white spaces and punctuation marks, John will remove them from the text before feeding it into the program.

---

【题目分析】
说了这么多，其实就是求一个字符串的最长回文字串。这数据规模，估计暴力也可以过了。或者可以用后缀数组，把原来的字串倒过来加在原串后边，中间插一个特殊字符。然后变成了两个字串中的最长公共字串了，nlogn。如果用manacher算法，就可以到n了。

---

【代码】

#include <cstdio>
#include <cstring>
using namespace std;
char s[1010],ss[2010];
int r[2010];
inline int min(int a,int b)
{return a>b?b:a;}
int main()
{
    scanf("%s",s+1);
    int l=strlen(s+1);
    ss[1]='#';ss[0]='@';
    for (int i=1;i<=l;++i){
        ss[i*2]=s[i];
        ss[i*2+1]='#';
    }
    s[l*2+2]='$';
    l=l*2+1;
    int id=0,mx=0,ans=0,maxi=0,maxx=0;
    for (int i=1;i<=l;++i){
        if (mx>i) r[i]=min(r[2*id-i],mx-i);
        else r[i]=0;
        while (ss[i-r[i]]==ss[i+r[i]]) r[i]++;
        if (i+r[i]>mx) mx=i+r[i],id=i;
        if (r[i]>maxx) maxi=i,maxx=r[i];
    }
    for (int i=maxi-maxx+1;i<=maxi+maxx-1;++i)
      if (ss[i]!='#') printf("%c",ss[i]);
    printf("\n");
}