Pagini recente » Cod sursa (job #470032) | Cod sursa (job #581435) | Cod sursa (job #230279) | Cod sursa (job #2713559) | Cod sursa (job #682550)
Cod sursa(job #682550)
#include<iostream>
#include<fstream>
using namespace std;
int v[100001],l[100001],p[100001],a[100001],nr;
ofstream g("scmax.out");
int cautarebinara(int x)
{
int p,q,mij;
p=0;
q=nr;
while(p<=q) {
mij=(p+q)/2;
if((v[l[mij]]<x)&&(v[l[mij+1]]>=x))
return mij;
else if(v[l[mij]]>x)
q=mij-1;
else p=mij+1;
}
return nr;
}
void afisare(int i)
{
if(p[i]>0)
afisare(p[i]);
g<<v[i]<<" ";
}
int main ()
{
int i,poz,n,max;
ifstream f("scmax.in");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
f.close();
a[1]=1;
l[1]=1;
nr=1;
for(i=2;i<=n;i++) {
poz=cautarebinara(v[i]);
p[i]=l[poz];
a[i]=poz+1;
l[poz+1]=i;
if(nr<(poz+1))
nr=poz+1;
}
max=0;
poz=0;
for(i=1;i<=n;i++)
if(a[i]>max) {
max=a[i];
poz=i;
}
g<<max<<'\n';
afisare(poz);
return 0;
}