Pagini recente » Cod sursa (job #2179374) | Cod sursa (job #1545756) | Cod sursa (job #1898036) | Cod sursa (job #349196) | Cod sursa (job #2568646)
#include <fstream>
#include <cstring>
#define N 501
using namespace std;
ifstream f ( "palm.in" );
ofstream g ( "palm.out" );
char S[N];
int main()
{ int Max = 0, i, j, k, n;
f >> ( S + 1 );
n = strlen ( S + 1 );
for ( i = 1; i <= n; i++ ){
for ( j = min ( i - 1, n - i ); j >= 1; j-- ){
int nr = 1;
if ( S[i - j] == S[i + j] && S[i - j] <= S[i] ){
nr += 2;
bool ok = 1;
for ( k = j - 1; k >= 1; k-- ){
if ( S[i - k] >= S[i - k - 1] && S[i - k] == S[i + k] && S[i - k] <= S[i] )
nr += 2;
else{
ok = 0;
break;
}
}
if ( ok == 1 ){
Max = max ( Max, nr );
break;
}
}
}
}
g << Max;
return 0;
}