Cod sursa(job #636309)
Utilizator | Ada-Mihaela Solcan ada_s | Data | 19 noiembrie 2011 18:39:24 |
---|---|---|---|
Problema | PalM | Scor | 0 |
Compilator | cpp | Status | done |
Runda | .com 2011 | Marime | 0.4 kb |
#include <stdio.h>
#include <string.h>
char sir[510];
int l, i, p, max;
int main()
{
freopen("palm.in", "r", stdin);
freopen("palm.out", "w", stdout);
scanf("%s", sir);
l=strlen(sir);
max=1;
for (i=0; i<l; i++)
{
p=1;
while (((i-p)>=0)&&((i+p)<l)&&(sir[i-p]==sir[i+p])&&(sir[i-p]<=sir[i-p+1]))
p++;
if (p>max)
max=p;
}//for i
max=(max-1)*2+1;
printf("%d\n", max);
return 0;
}//main