Pagini recente » Borderou de evaluare (job #1258135) | Borderou de evaluare (job #2040480) | Cod sursa (job #1080055) | Cod sursa (job #2559763) | Cod sursa (job #608383)
Cod sursa(job #608383)
#include<stdio.h>
long v[100001],b[100001],max,i,n,j,r;
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[n]=1;
for (i=n-1;i>=1;i--)
{
max=0;
for (j=i+1;j<=n;j++)
if (v[i]<v[j])
{
if (max<b[j])
max=b[j];
}
b[i]=max+1;
}
max=0;
for (i=1;i<=n;i++)
if (max<b[i])
{
r=i;
max=b[i];
}
printf("%ld\n",max);
for (i=1;i<=n;i++)
if (b[i]==max)
{
printf("%ld ",v[i]);
max--;
}
}