Pagini recente » Cod sursa (job #2280793) | Cod sursa (job #675826) | Cod sursa (job #956607) | Cod sursa (job #1345528) | Cod sursa (job #1189034)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("palm.in");
ofstream g("palm.out");
int l,lung,LM;
char s[501],ant;
int main()
{
f.getline(s,501);
l = strlen(s);
for (int i = 0; i < l; ++i)
{
lung = 1;
ant = s[i];
for (int j = 1; i+j < l && i-j >= 0; ++j)
{
if (s[i+j] <= ant && s[i+j] == s[i-j])
lung += 2;
else break;
}
if (lung > LM)
LM = lung;
}
for (int i = 0; i < l-1; ++i)
{
if (s[i] == s[i+1])
{
lung = 2;
ant = s[i];
for (int j = 1; i-j >= 0 && i+1+j < l; ++j)
{
if (s[i-j] <= ant && s[i-j] == s[i+j+1])
lung += 2;
else break;
}
if (lung > LM)
LM = lung;
}
}
g << LM;
f.close();
g.close();
return 0;
}