Pagini recente » Cod sursa (job #3164924) | Cod sursa (job #338497) | Cod sursa (job #1333017) | Cod sursa (job #2675149) | Cod sursa (job #752009)
Cod sursa(job #752009)
#include <fstream>
using namespace std;
int a[100000],q[100000],p[100000],i,j,n,mx,mij,st,dr,l,pz;
int main()
{
ifstream f("scmax.in");
ofstream g("scmax.out");
f>>n;
for (i=1; i<=n; i++) f>>a[i];
q[1]=a[1];
l=1;
for (i=2; i<=n; i++)
{
st=1;
dr=l;
pz=0;
while (st<= dr && pz==0 )
{
mij=(st+dr)/2;
if (q[mij]==a[i] ) pz=mij;
else if (q[mij]>a[i]) dr=mij-1;
else st=mij+1;
}
if (pz==0) pz=st;
q[pz]=a[i];
if (st>l) l=st;
p[i]=pz;
if (p[i]>mx) mx=p[i];
}
g<<mx<<'\n';
mx=0;
for (i=1; i<=n; i++) if (q[i]>mx) mx=q[i];
for (i=1; i<=n; i++) if (p[i]!=p[i+1] && p[i]!=0 ) g<<a[i]<<" ";
return 0;
}