PAT 1040 Longest Symmetric String

Given a string, you are supposed to output the length of the longest symmetric sub-string. For example, given "Is PAT&TAP symmetric?", the longest symmetric sub-string is "s PAT&TAP s", hence you must output 11.

Input Specification:

Each input file contains one test case which gives a non-empty string of length no more than 1000.

Output Specification:

For each test case, simply print the maximum length in a line.

题目说明一目了然，就是找出最长对称子串。

代码如下：

#include<stdio.h>
#include<string.h>
int main()
{
	int l,max,i,j,count;
	char a[1100];
	gets(a);
	l=strlen(a);
	max=0;
	for(i=0;i<l;i++)
	{
		count=0;
		for(j=0;j<i+1&&j<l-i;j++)
		{
		    if(a[i-j]==a[i+j])
			count=2*j+1;
		    else
                	break;
		}
		max=max>count?max:count;
		for(j=1;j<=i+1&&j<=l-i-1;j++)
    	        {
	            if(a[i-j+1]==a[i+j])
		        count=2*j;
	    	    else
		     	break;
                }
       	        max=max>count?max:count;
     }   	
	printf("%d\n",max);
	//getchar();
	return 0;
}