1040. Longest Symmetric String (25)，longestsymmetric

1040. Longest Symmetric String (25)，longestsymmetric

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.

Sample Input:
Is PAT&TAP symmetric?
Sample Output:

11

#include <iostream>#include <string.h>using namespace std;char s[1001];int main() {    int i, j, x ,y;    while(gets(s)) {        int max  = 0;        for(i=0; i<strlen(s); i++) {            for(j=0; i-j >= 0 && i+j < strlen(s); j++) { //奇數時                if(s[i-j] != s[i+j])                    break;                if(j * 2 + 1 > max) {                    max = j * 2 + 1;                }            }            for(j=0; i-j >= 0 && i+j+1 < strlen(s); j++) {//偶數時                if(s[i-j] != s[i+j+1])                    break;                if(j * 2 + 2 > max) {                    max = j * 2 + 2;                }            }        }        cout<<max<<endl;    }    return 0;}