Sample Input
abcbabcbabcba abacacbaaaab END
Sample Output
Case 1: 13 Case 2: 6
就是裸的求最大回文字串
//$#a#a#a#b#
#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
const int mx=1000000+100;
int p[2*mx],len;
char s[2*mx];
int main(){
int T=1;
while(~scanf("%s",s)&&strcmp(s,