Pagini recente » Cod sursa (job #3171276) | Cod sursa (job #2091302) | Cod sursa (job #212909) | Cod sursa (job #1248739) | Cod sursa (job #411640)
Cod sursa(job #411640)
#include <stdio.h>
int n,i,j,a[100003],b[100003];
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]);
b[n]=1;
for(i=n-1;i>=1;i--)
{
b[i]=1;
for(j=i+1;j<=n;j++)
if(a[i]<a[j] && b[i]<b[j]+1)
{
b[i]=b[j]+1;
}
}
int max=b[1],p=1;
for(i=2;i<=n;i++)
if(b[i]>max)
{
max=b[i];
p=i;
}
printf("%d\n",max);
printf("%d ",a[p]);
max=a[p];
for(i=p+1;i<=n;i++)
if(a[i]>max)
{
max=a[i];
printf("%d ",max);
}
return 0;
}