Pagini recente » Cod sursa (job #2199318) | Cod sursa (job #2430298) | Cod sursa (job #571716) | Cod sursa (job #3192006) | Cod sursa (job #1706109)
#include <iostream>
#include <fstream>
#include <string.h>
using namespace std ;
ifstream fin("palm.in") ;
ofstream fout("palm.out") ;
int main(){
char s[500 + 10] ;
int n , sol = 1 ;
fin >> s ;
n = strlen(s) ;
if(s[n - 1] == s[n - 2]){
sol = 2 ;
}
for(int i = 1 ; i < n - 1 ; i ++){
int st = i - 1 , dr = i + 1 ;
while(st >= 0 && dr < n && s[st] == s[dr] && s[st] <= s[st + 1] && s[dr] <= s[dr - 1]){
st -- ;
dr ++ ;
}
sol = max(sol , dr - st - 1) ;
st = i - 1 ; dr = i ;
if(s[st] == s[dr]){
st -- ;
dr ++ ;
while(st >= 0 && dr < n && s[st] == s[dr] && s[st] <= s[st + 1] && s[dr] <= s[dr - 1]){
st -- ;
dr ++ ;
}
sol = max(sol , dr - st - 1) ;
}
}
fout << sol ;
fin.close() ;
fout.close() ;
return 0 ;
}