Pagini recente » Cod sursa (job #141855) | Cod sursa (job #420438) | Cod sursa (job #2095212) | Cod sursa (job #3004076) | Cod sursa (job #681180)
Cod sursa(job #681180)
#include<stdio.h>
#define MAX_N 100001
int n,i,Lm,p,L[MAX_N],a[MAX_N];
void dinamica()
{
int i,j,max;
L[n]=1;
for(i=n-1; i>=1; i--)
{
max=0;
for(j=i+1; j<=n; j++)
if(L[j]>max && a[i]<=a[j])
max=L[j];
L[i]=max+1;
if(Lm<L[i])
Lm=L[i];
}
}
void drum()
{
int t;
t=0; p=1;
do
{
while(L[p]!=Lm || a[t]>a[p])
p++;
printf("%d ",a[p]);
t=p;
Lm--;
}while(Lm);
}
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d",&n);
for(i=1; i<=n; i++)
scanf("%d",&a[i]);
dinamica();
printf("%d\n",Lm);
drum();
return 0;
}