Pagini recente » Cod sursa (job #1189403) | Cod sursa (job #2893544) | Cod sursa (job #484731) | Cod sursa (job #2897583) | Cod sursa (job #271947)
Cod sursa(job #271947)
#include<stdio.h>
#define N 100005
int a[N],n,lung[N],v[N];
void citire()
{
int i;
scanf("%d",&n);
for(i=1;i<=n;++i)
scanf("%d",&a[i]);
}
void solve()
{
int i,j,max,k=0;
citire();
lung[1]=1;
for(i=2;i<=n;++i)
{
/*
j=i-1;
while(j>0&&a[j]>=a[i])
--j;
if(j==0)
lung[i]=1;
else
lung[i]=lung[j]+1;
printf("%d ",lung[i]);
*/
max=0;
for(j=1;j<i;++j)
if(a[j]<a[i] && lung[j]>max)
max=lung[j];
lung[i]=1+max;
}
max=1;
for(i=1;i<=n;++i)
if(lung[i]>max)
max=lung[i];
printf("%d\n",max);
// printf("%d\n",lung[n]);
max=lung[n];
i=n;
while(lung[i]==lung[i-1])
--i;
v[++k]=a[i];
while(i)
if(lung[i]!=max-1)
--i;
else
{
v[++k]=a[i];
max=lung[i];
--i;
}
for(i=k;i>=1;--i)
printf("%d ",v[i]);
}
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
solve();
return 0;
}