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.

---

Sample Input:

Is PAT&TAP symmetric?

Sample Output:

11

---

题目大意

求最长回文子串

---

思路

见代码

---

C/C++ 

#include<bits/stdc++.h>
using namespace std;
int OP(int head,int tail);
string s;
int main()
{
    getline(cin,s);
    int result=1,key;
    for(int z=0;z<s.size();z++){
        key = max(OP(z,z),OP(z,z+1));
        result = max(result,key);
    }
    cout << result-1;
    return 0;
}
int OP(int head,int tail)
{
    if(head<0 || tail>=s.size() || s[head]!=s[tail]) return tail-head;
    return OP(head-1,tail+1);
}

---