Pagini recente » Cod sursa (job #2389315) | Cod sursa (job #3123525) | Cod sursa (job #1030116) | Cod sursa (job #2415226) | Cod sursa (job #635975)
Cod sursa(job #635975)
#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++)
{
if(s[i] && s[i+1] && s[i]==s[i+1])
{k=2;
for(j=1;j<=i+1;j++)
if(s[i-j]==s[i+j+1] && s[i-j]<=s[i-j+1] && s[i+j]<=s[i+j-1] && s[i-j] && s[i+j+1])
k+=2;
if(k>maxim)maxim=k;
}
k=1;
for(j=1;j<=i+1;j++)
if(s[i-j]==s[i+j] && s[i-j]<=s[i-j+1] && s[i+j]<=s[i+j-1] && s[i-j] && s[i+j])
k+=2;
if(k>maxim)maxim=k;
}
g<<maxim;
f.close();g.close();
return 0;}