Pagini recente » Cod sursa (job #2011519) | Monitorul de evaluare | Cod sursa (job #3351017) | Cod sursa (job #2092397) | Cod sursa (job #2289965)
#include <fstream>
using namespace std;
ifstream f ("scmax.in");
ofstream g ("scmax.out");
const int nmax=1e5+3;
int n,v[nmax],usu[nmax],p[nmax],sol,k,t[nmax],nr=1,poz;
void afis(int i)
{
if(p[i]>0) afis(p[i]);
g<<v[i]<<' ';
}
int caut(int x)
{
int st,dr,m;
st=0;
dr=nr;
while(st<=dr)
{
m=(st+dr)/2;
if(v[t[m]]<x&&v[t[m+1]]>=x) return m;
else if(v[t[m+1]]<x) st=m+1;
else dr=m-1;
}
return nr;
}
int main()
{
f>>n;
for(int i=1;i<=n;++i) f>>v[i];
usu[1]=t[1]=1;
for(int i=2;i<=n;++i)
{
poz=caut(v[i]);
p[i]=t[poz];
usu[i]=poz+1;
t[poz+1]=i;
if(nr<poz+1) nr=poz+1;
}
poz=0;
for(int i=1;i<=n;++i)
{
if(sol<usu[i])
{
sol=usu[i];
poz=i;
}
}
g<<sol<<'\n';
afis(poz);
return 0;
}