6 solutions
-
0
#include<bits/stdc++.h> using namespace std; string s[1010]; int main() { string a; cin>>a; int mx=1; int n=a.size(); for(int i=1;i<=n;i++) s[i]=a[i-1]; for(int i=1;i<=n;i++){ for(int j=i;j<=n;j++){ bool b=1; for(int l=0;l<=(j-i)/2;l++){ if(s[i+l]!=s[j-l]){ b=0; break; } } if(b) mx=max(mx,j-i+1); } } cout<<mx; return 0; }
Information
- ID
- 79
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 3
- Tags
- # Submissions
- 119
- Accepted
- 40
- Uploaded By