Pagini recente » Cod sursa (job #2952674) | Cod sursa (job #2631625) | Cod sursa (job #128957) | Cod sursa (job #1340184) | Cod sursa (job #822947)
Cod sursa(job #822947)
#include <stdio.h>
using namespace std;
int main()
{
int lmax=0,i,n,v[100001],l[100001],j,max;
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&v[i]);
l[n]=1;
for(i=n-1;i>=1;i--)
{
max=0;
for(j=n;j>=i+1;j--)
if(v[i]<v[j])
if(l[j]>max)
{
max=l[j];
l[i]=max+1;
}
if(max==0)
l[i]=1;
if(max+1>lmax)
lmax=max+1;
}
printf("%d\n",lmax);
for(i=1;i<=n;i++)
if(l[i]==lmax)
{
printf("%d ",v[i]);
lmax--;
}
return 0;
}