Pagini recente » Cod sursa (job #1320196) | Cod sursa (job #831117) | Cod sursa (job #1675318) | Cod sursa (job #522327) | Cod sursa (job #636028)
Cod sursa(job #636028)
#include<fstream>
#include<string>
using namespace std;
ifstream f("palm.in");
ofstream g("palm.out");
char c[501];
int i,x[501],a[501],m,n,j,st,dr;
int main()
{
f>>c;
n=strlen(c);
for(i=1;i<=n;i++)
{
a[i]=1;
x[i]=int(c[i-1])-96;
}
for(i=2;i<=n-1;i++)
{
st=i-1;
dr=i+1;
if(x[st]==x[dr])
{
a[i]+=2;
while(x[st-1]==x[dr+1] && x[st-1]<=x[st] && st-1>0 && dr+1<=n)
{
st--;
dr++;
a[i]+=2;
}
}
}
int maxx=a[1];
for(i=1;i<=n;i++) if(a[i]>maxx) maxx=a[i];
g<<maxx;
f.close();
g.close();
return 0;
}