Pagini recente » Cod sursa (job #1748576) | Cod sursa (job #3184499) | Cod sursa (job #557456)
Cod sursa(job #557456)
#include<fstream>
#include<cstdio>
#include<cstring>
using namespace std;
int v[100010];
//int best[20010],poz[20010],nr=1;
int n,L[100010],poz,nr=1;
inline int caut(int x)
{
int p=0,u=nr,m=(p+u)/2;
while(p<=u)
{
if(x>L[m] && x<=L[m+1])
return m;
if(x>L[m+1])
{
p=m+1;
m=(p+u)/2;
}
else
{
u=m-1;
m=(p+u)/2;
}
}
return nr;
}
int main()
{
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int i;
fin>>n;
for(int i=1;i<=n;++i)
fin>>v[i];
L[1]=v[1];
for(int i=2;i<=n;++i)
{
poz=caut(v[i]);
L[poz+1]=v[i];
if(nr<poz+1)
nr=poz+1;
}
fout<<nr<<'\n';
for(int i=1;i<=nr;++i)
fout<<L[i]<<' ';
return 0;
}