Pagini recente » Cod sursa (job #2393917) | Cod sursa (job #2666326) | Cod sursa (job #532405) | Cod sursa (job #1306246) | Cod sursa (job #806535)
Cod sursa(job #806535)
#include<fstream>
using namespace std;
int a[100000],b[100000],c[100000][2],n,d[100000],l,p;
void maxim()
{
freopen("scmax.out","w",stdout);
int i,m=0,p;
for(i=0;i<n;i++)
if(b[i]>m)
{
p=i;
m=b[i];
}
printf("%d\n",m);
d[l++]=a[p];
while(m>1)
{
int sw=0;
i=p-1;
while(!sw)
{
if(a[i]<a[p] && b[i]==m-1)
sw=1;
else
i--;
}
d[l++]=a[i];
m--;
p=i;
}
for(i=l-1;i>=0;i--)
printf("%d ",d[i]);
printf("\n");
}
int main()
{
int i,j,m;
freopen("scmax.in","r",stdin);
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
b[i]=1;
c[i][0]=c[i][1]=i;
m=0;
for(j=i-1;j>=0;j--)
if(a[j]<a[i])
if(m<b[j])
{
m=b[j];
b[i]=b[j]+1;
c[i][0]=c[j][0];
}
}
maxim();
return 0;
}