Pagini recente » Cod sursa (job #57969) | Cod sursa (job #1407988) | Cod sursa (job #1753681) | Cod sursa (job #684462) | Cod sursa (job #637061)
Cod sursa(job #637061)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("palm.in");
ofstream g("palm.out");
string s;
int i,n,v[501],sol=0,j,a[501],A,b[501],B;
int LCIS (int A,int B,int x) {
int cr,l,i,j,ap=0,s;
int c[501];
memset(c,0,sizeof(c));
for (i=1;i<=A;i++) {
cr=0;
if (v[i]==x) ap++;
for (j=n;j>=B;j--) {
if (v[i]==v[j] && cr+1>c[j])
c[j]=cr+1;
if (v[j]<v[i] && cr<c[j])
cr=c[j];
if (v[j]==x && i==1) ap++;
}
}
l=0;int ind=-1;
for (i=1;i<=n;i++)
if (c[i]>l) {
l=c[i];
ind=i;
}
s=2*l;
if (ap%2==0) s-=1;
else s-=0;
return s;
}
int main () {
f >> s;
n=s.size();
for (i=1;i<=n;i++) v[i]=int(s[i-1])-int('a')+1;
for (i=2;i<n;i++) {
A=B=0;//memset(a,0,sizeof(a));memset(b,0,sizeof(b));
/*for (j=1;j<=i;j++)
if (v[j]<=v[i]) a[++A]=v[j];
for (j=n;j>=i;j--)
if (v[j]<=v[i]) b[++B]=v[j];*/
A=i;B=i;
sol=max(sol,LCIS(A,B,v[i]));
}
g << sol << '\n';
f.close();g.close();
return 0;
}