Pagini recente » Cod sursa (job #1914351) | Cod sursa (job #722447) | Cod sursa (job #484439) | Cod sursa (job #653141) | Cod sursa (job #2631028)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,a[100010],b[100010],l[100010],maxi,lmax=0;
int afis(int x)
{ if(x==0) return 0;
afis(b[x]);
g<<a[x]<<' ';
}
int main()
{
f>>n;
for(int i=1;i<=n;i++) f>>a[i];
b[1]=0;
l[1]=1;
for(int i=2;i<=n;i++)
{ b[i]=0;
l[i]=1;
for(int j=1;j<=i;j++)
{ if(l[j]>=l[i]&&a[j]<a[i])
{ l[i]=l[j]+1;
b[i]=j;
if(l[i]>lmax)
{ lmax=l[i];
maxi=i;
}
}
}
}
g<<lmax<<'\n';
afis(maxi);
return 0;
}