Pagini recente » Cod sursa (job #2046320) | Cod sursa (job #2015684) | Cod sursa (job #2610440) | Rating Marcel Hosu (marcel_hosu) | Cod sursa (job #2068200)
#include <iostream>
using namespace std;
int n,i,a[1001],l[1001],lmax,Max,p,ult,j;
int main()
{
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
}
lmax=0;
l[n]=1;
for(i=n-1;i>=1;i--)
{
Max=0;
for(j=i+1;j<=n;j++)
{
if(a[i]<a[j] && Max<l[j])
{
Max=l[j];
}
}
l[i]=Max+1;
if(lmax<l[i])
{
lmax=l[i];
p=i;
}
}
cout<<lmax<<'\n';
ult=a[p]-1;
for(i=p;i<=n;i++)
{
if(a[i]>ult && l[i]==lmax)
{
cout << a[i] << " ";
ult=a[i];
lmax--;
}
}
return 0;
}