Pagini recente » Cod sursa (job #2304663) | Cod sursa (job #588600) | Cod sursa (job #947785) | Cod sursa (job #2386470) | Cod sursa (job #2537335)
#include<bits/stdc++.h>
using namespace std;
ifstream fin("palm.in");
ofstream fout("palm.out");
int nr,sol,i,n,j;
char s[510];
int main()
{
fin>>s;
n=strlen(s);
for(i=0;i<n;i++)
{
nr=1;
for(j=1;i-j>=0&&i+j<=n;j++)
if(s[i-j]==s[i+j]&&s[i-j]<=s[i-j+1]) nr+=2;
else break;
sol=max(sol,nr);
}
for(i=0;i<n-1;i++) if(s[i]==s[i+1])
{
nr=2;
for(j=1;i-j>=0&&i+j+1<=n;j++)
if(s[i-j]==s[i+j+1]&&s[i-j]<=s[i-j+1]) nr+=2;
else break;
sol=max(sol,nr);
}
fout<<sol;
return 0;
}