Pagini recente » Cod sursa (job #565998) | Cod sursa (job #673461) | Cod sursa (job #1913497) | Cod sursa (job #2205371) | Cod sursa (job #310647)
Cod sursa(job #310647)
#include<fstream>
void af(int);
int caut (int);
const int nmax=100010;
int n,v[nmax],p[nmax],b[nmax],l[nmax],k,nr,max;
int main()
{
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int i,poz;
nr=1;
fin>>n;
for(i=1;i<=n;i++)fin>>v[i];
b[1]=l[1]=1;
l[0]=0;
for(i=2;i<=n;i++)
{
poz=caut(v[i]);
p[i]=l[poz];
b[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(max<b[i])
{
max=b[i];
poz=i;
}
fout<<max<<"\n";
af(poz);
return 0;
}
int caut(int x)
{
int p=0,u=nr,m=(p+u)/2;
while(p<=u)
{
if(v[l[m]]<x&&v[l[m+1]]>=x)return m;
else if(v[l[m+1]]<x)
{
p=m+1;
m=(p+u)/2;
}
else
{
u=m-1;
m=(p+u)/2;
}
}
return nr;
}
void af(int i)
{
if(p[i]>0)af(p[i]);
fout<<v[i]<<" ";
}