Pagini recente » Cod sursa (job #2984813) | Cod sursa (job #745613) | Cod sursa (job #917729) | Cod sursa (job #2524072) | Cod sursa (job #528405)
Cod sursa(job #528405)
#include<fstream>
using namespace std;
ofstream g("scmax.out");
unsigned long long a[10000001];
long i,j,n,m,b[1000001],p[1000001],l[1000001],x,nr=0;
long max1,poz;
int cauta(int x)
{
int st,dr,mij;
st=0,dr=nr,mij=(st+dr)/2;
while(st<=dr)
{
if(a[l[mij]]<x&&a[l[mij+1]]>=x)
return mij;
else
if(a[l[mij+1]]<x)
st=mij+1,mij=(st+dr)/2;
else
dr=mij-1,mij=(st+dr)/2;
}
return nr;
}
void afis(int i)
{
if(p[i]>0)
afis(p[i]);
g<<a[i]<<" ";
}
int main()
{
ifstream f("scmax.in");
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
b[1]=l[1]=1;
l[0]=0;
for(i=2;i<=n;i++)
{
x=cauta(a[i]);
p[i]=l[x];
b[i]=x+1;
l[x+1]=i;
if(nr<x+1)
nr=x+1;
}
max1=poz=0;
for(i=1;i<=n;i++)
if(b[i]>max1)
{
max1=b[i];
poz=i;
}
g<<max1<<"\n";
afis(poz);
return 0;
}