Pagini recente » Cod sursa (job #900826) | Cod sursa (job #2033138) | Cod sursa (job #1140407) | Cod sursa (job #1517608) | Cod sursa (job #1268665)
#include <fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int n,a[100003],best[100003],l[100003],t[100003],nr;
void af(int x)
{
if(t[x]>0) af(t[x]);
out<<a[x]<<" ";
}
int bs(int x)
{int p,u,m;
p=0;
u=nr;
m=(p+u)/2;
while(p<=u)
{
if(a[l[m]]<x&&a[l[m+1]]>= x)
return m;
else
if(a[l[m+1]]<x)
{
p=m+1;
m=(p+u)/2;
}
else
{
u=m-1;
m=(p+u)/2;
}
}
return nr;
}
int main()
{int i,poz,mx=0,pp=0;
in>>n;
for(i=1;i<=n;i++)
{
in>>a[i];
}
best[1]=l[1]=1;
l[0]=0;
nr=1;
for(i=2;i<=n;i++)
{
poz=bs(a[i]);
t[i]=l[poz];
best[i]=poz+1;
l[poz+1]=i;
if(nr<poz+1) nr=poz+1;
if(mx<best[i]) mx=best[i],pp=i;
}
out<<mx<<'\n';
af(pp);
return 0;
}