Pagini recente » Cod sursa (job #195242) | Cod sursa (job #373812) | Cod sursa (job #1651564) | Cod sursa (job #1114695) | Cod sursa (job #1807250)
#include<cstdio>
using namespace std;
int ok,p,k,n,i,ma,j,a[1001],b[1001];
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]);
for(i=n;i>=1;i--)
{
ma=0;
for(j=i+1;j<=n;j++)
{
if(a[i]<a[j])
if(b[j]>ma)
ma=b[j];
}
b[i]=ma+1;
}
ma=0;
for(i=1;i<=n;i++)
if(b[i]>ma)
{
ma=b[i];
p=i;
}
printf("%d\n",ma);
k=ma;
ok=1;
while(ok<=ma)
{
for(i=p;i<=n;i++)
if(b[i]==k)
{
printf("%d ",a[i]);
p=i;
k--;
ok++;
break;
}
}
return 0;
}