Pagini recente » Cod sursa (job #167632) | Cod sursa (job #1321381) | Cod sursa (job #1592495) | Cod sursa (job #1594223) | Cod sursa (job #243750)
Cod sursa(job #243750)
#include<stdio.h>
int a[100000],m,i,k,b[100000],c[100000],p,n,max;
void copy()
{max=k;
for(p=1;p<=k;p++)
c[p]=b[p];
}
void back(int i)
{
for(i;i<=n;i++)
{
if(a[i]>b[k])
{//printf("%d %d %d %d\n",a[i],b[k],k,max);
b[++k]=a[i];
if(k>max)
copy();
back(i+1);
k--;
}
}
}
void read()
{
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
}
void print()
{
printf("%d\n",max);
for(i=1;i<=max;i++)
printf("%d ",c[i]);
}
int main ()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
b[0]=b[1]=k=max=0;
read();
back(1);
print();
return 0;
}