Pagini recente » Cod sursa (job #3123824) | Cod sursa (job #3256337) | Cod sursa (job #1358114) | Cod sursa (job #2925963) | Cod sursa (job #1807339)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int m[100005],v[100005],p[100005],k[100005],n,lg,st,mij,dr,x,a,aux;
void print(int i)
{
if(i==0)
{
return;
}
print(p[i]);
fout<<v[i]<<" ";
}
int main()
{
int i;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x;
v[i]=x;
if(x>m[lg])
{
lg++;
m[lg]=x;
p[i]=k[lg-1];
k[lg]=i;
}
else
{
st=0;
dr=lg;
/*while(st<dr)
{
mij=(st+dr)/2;
if(x>m[mij])
{
st=mij+1;
}
else if(x==m[mij])
{
dr=mij-1;
}
}*/
for(a=1;a<=n;a<<=1);
while(a!=0)
{
a>>=1;
aux=st+a;
if(aux>lg)
{
continue;
}
if(m[aux]<x)
{
st=aux;
}
}
m[st+1]=x;
p[i]=k[st];
k[st+1]=i;
}
}
fout<<lg<<'\n';
print(k[lg]);
return 0;
}