Pagini recente » Cod sursa (job #29823) | Cod sursa (job #2791107) | Cod sursa (job #3232359) | Cod sursa (job #2613194) | Cod sursa (job #2118384)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,m,pozmic[100001],pred[100001],v[100001],i,j;
int cb(int x)
{
int r=0,pas=1<<16;
while(pas!=0)
{
if(r+pas<=m&&v[pozmic[r+pas]]<x)
{
r+=pas;
}
pas/=2;
}
return r;
}
void subsir(int p)
{
if(p>1)subsir(pred[p]);
fout<<v[p]<<" ";
}
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
for(i=1;i<=n;i++)
{
j=cb(v[i]);
pozmic[j+1]=i;
pred[i]=pozmic[j];
if(j==m)m++;
}
fout<<m<<'\n';
subsir(pozmic[m]);
return 0;
}