Run ID:3666

提交时间:2024-06-22 17:04:27

# include<iostream> # include<string> # include<algorithm> using namespace std; bool hw(string s1){ for(int i=0;i<s1.size();i++){ if(s1[i]!=s1[s1.size()-1-i]) return 0; } return 1; } int main(){ string s1,s2; int longest=0; getline(cin,s1); for(int i=0;i<=s1.size();i++){ s2=""; for(int j=i;j<=s1.size();j++){ s2=s2+s1[j]; if(hw(s2)==1&&s2.size()>longest) longest=s2.size(); } } cout<<longest<<endl; return 0; }