Pagini recente » Cod sursa (job #2901365) | Cod sursa (job #2304346) | Cod sursa (job #2075804) | Cod sursa (job #2872100) | Cod sursa (job #2170186)
#include <iostream>
#include <cstdio>
#define N 100005
using namespace std;
int n, a[N], s1[N], s2[N], lg;
int caut(int x, int st, int dr)
{
if(st==dr)
{
if(s1[st]>=x)
return st;
return -1;
}
int mij=(st+dr)/2;
if(s1[mij]<x)
return caut(x, mij+1, dr);
return caut(x, st, mij);
}
void citire()
{
scanf("%d\n", &n);
scanf("%d ", &a[1]);
s1[++s1[0]]=a[1];
s2[1]=1;
for(int i=2;i<=n;i++)
{
scanf("%d ", &a[i]);
int poz=caut(a[i], 1, s1[0]);
if(poz==-1)
{
s1[++s1[0]]=a[i];
s2[i]=s1[0];
}
else
{
s1[poz]=a[i];
s2[i]=poz;
}
}
}
void subsir(int i)
{
if(i==0)
return;
if(s2[i]==lg)
{
lg--;
subsir(i-1);
printf("%d ", a[i]);
}
subsir(i-1);
}
int main()
{
freopen("scmax.in", "r", stdin);
freopen("scmax.out", "w", stdout);
citire();
printf("%d\n", s1[0]);
lg=s1[0];
subsir(n);
return 0;
}