Pagini recente » Borderou de evaluare (job #904654) | Cod sursa (job #948194) | Cod sursa (job #1540104) | Cod sursa (job #2662101) | Cod sursa (job #608373)
Cod sursa(job #608373)
#include<stdio.h>
long v[100001],b[100001],max,i,n,j,r,c[100001],u;
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d",&n);
for (i=1;i<=n;i++)
scanf("%ld",&v[i]);
b[1]=1;
for (i=2;i<=n;i++)
{
max=0;
for (j=i-1;j>=1;j--)
if (v[i]>v[j])
{
if (max<b[j]+1)
max=b[j]+1;
}
b[i]=max;
}
max=0;
for (i=1;i<=n;i++)
if (max<b[i])
{
r=i;
max=b[i];
}
printf("%ld\n",max);
max--;
c[++u]=v[r];
while (max)
{
for (i=r;i>=1;i--)
if (b[i]==max)
{
c[++u]=v[i];
break;
}
max--;
}
for (i=u;i>=1;i--)
printf("%ld ",c[i]);
}