Cod sursa(job #635916)
Utilizator | UPB-Oprea-Cosmin-Dumitru batista | Data | 19 noiembrie 2011 15:36:18 |
---|---|---|---|
Problema | PalM | Scor | 20 |
Compilator | cpp | Status | done |
Runda | .com 2011 | Marime | 0.37 kb |
#include<fstream>
#include<cstdlib>
using namespace std;
char s[505];
int i,j,k,maxim,n;
int main()
{
ifstream f("palm.in");ofstream g("palm.out");
f.getline(s,501);
for(i=0;s[i];i++)
{
k=1;
for(j=1;j<i+1 && s[i-j]==s[i+j] && s[i-j]<=s[i-j+1] && s[i+j]<=s[i+j-1];j++)
k+=2;
if(k>maxim)maxim=k;
}
g<<maxim;
f.close();g.close();
return 0;}