http://pat.zju.edu.cn/contests/pat-practise/1040

1040. Longest Symmetric String (25)

时间限制

400 ms

内存限制

32000 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

gets(char * s)读入一行

max初始为1

[cpp]  view plain copy

1. #include <iostream>  
2. #include <string>  
3. #include <algorithm>  
4. #include <memory.h>  
5. #include <cstdio>  
6. #include <cstdlib>  
7. #include <vector>  
8. using namespace std;  
9. #define MAX 0Xfffffff  
10. char s[1001];  
11. int main(){  
12.   
13.     //freopen("in.txt", "r", stdin);  
14.   
15.     gets(s);  
16.     int len = strlen(s);  
17.     int max = 1;  
18.     for(int i=0;i<len;++i){  
19.         if(i+1<len && s[i]==s[i+1]){  
20.             for(int j=1;j<len;++j){  
21.                 if(i-j>=0 && i+1+j<len){  
22.                     if(s[i-j]!=s[i+1+j]){  
23.                         break;  
24.                     }  
25.                     if(max<2*j+2)  
26.                         max = 2*j+2;  
27.                 }else  
28.                     break;  
29.             }  
30.         }  
31.         for(int j=1;j<len;++j){  
32.             if(i-j>=0 && i+j<len){  
33.                 if(s[i-j]!=s[i+j]){  
34.                     break;  
35.                 }  
36.                 if(max<2*j+1)  
37.                     max = 2*j+1;  
38.             }else  
39.                 break;  
40.         }  
41.       
42.     }  
43.     cout<<max<<endl;  
44.     //fclose(stdin);  
45. }