Pagini recente » Cod sursa (job #157179) | Cod sursa (job #1061299) | Cod sursa (job #3135134) | Cod sursa (job #2679750) | Cod sursa (job #2720187)
#include <bits/stdc++.h>
using namespace std;
ifstream f("palm.in");
ofstream g("palm.out");
int n,sol,a[510][510];
char s[510];
int main()
{
f>>s+1;
n=strlen(s+1);
for(char ch='z'; ch>='a'; ch--)
{
for(int dim=2; dim<=n; dim++)
{
for(int i=1; i<=n-dim+1; i++)
{
int j=i+dim-1;
if(s[i]==ch)
{
a[i][i]=1;
if(s[i]==s[j])a[i][j]=max(a[i][j],2+a[i+1][j-1]);
}
a[i][j]=max(a[i][j],max(a[i+1][j],a[i][j-1]));
sol=max(sol,a[i][j]);
}
}
}
g<<sol<<'\n';
return 0;
}