Cod sursa(job #672428)
Utilizator | Data | 2 februarie 2012 10:03:57 | |
---|---|---|---|
Problema | PalM | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream f("palm.in");
ofstream g("palm.out");
int i,st,dr,MAX,L=-1;
string s;
int main()
{
f>>s;
for(i=0; i<s.length(); i++,L=1)
{
st=i,dr=i;
while(st>=0&&dr<s.length()&&s[st]==s[dr])
{
if (s[st]<s[st-1]) break;
st--,dr++,L+=2;
}
MAX=max(L,MAX);
}
g<<MAX<<'\n';
f.close();
g.close();
return 0;
}