Pagini recente » Cod sursa (job #2392716) | Cod sursa (job #2619550) | Cod sursa (job #2498004) | Cod sursa (job #2138493) | Cod sursa (job #1342922)
#include<iostream>
using namespace std;
long a[100001] , l[100001] , poz[100001];
int main()
{
int n,i,j;
cin>>n;
for(i=1;i<=n;++i) {
cin>>a[i];
l[i]=1; }
int max=-1, indice;
for(i=n;i>=1;--i){
for(j=n;j>1;--j)
if( a[i] <a[j] )
if( l[i] < l[j]+1 ){
l[i]=l[j]+1;
poz[i]=j;
}
if(max<l[i]){
max=l[i];
indice=i;
}
}
cout<<max<<endl;
while( indice!=0) {
cout<<a[indice]<<" ";
indice=poz[indice];
}
return 0;
}