Pagini recente » Cod sursa (job #2834004) | Cod sursa (job #1613642) | Cod sursa (job #1559133) | Cod sursa (job #317754) | Cod sursa (job #2519341)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
long long v[100001],i,j,n,m,k,l[100001],x[100001],st,dr,mij,poz,ult,lg,sol[100001];
int main()
{
k=0; //k lungimea subsirului maximal
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
{
//caut pozitia pt v[i] in vectorul x astfel
st=1;dr=k;poz=k+1;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[i]>x[mij])
st=mij+1;
else
{
poz=mij;
dr=mij-1;
}
}
x[poz]=v[i];
l[i]=poz;
if(poz==k+1)
k++;
}
g<<k<<"\n";
i=n;lg=k;
m=0;
ult=2000000000;
while(lg>0)
{
if(l[i]==lg&&v[i]<ult)
{
m++;
sol[m]=v[i];
lg--;
}
i--;
}
for(i=m;i>=1;i--)
g<<sol[i]<<" ";
return 0;
}