Pagini recente » Cod sursa (job #2062291) | Cod sursa (job #2366047) | Cod sursa (job #2108297) | Cod sursa (job #782896) | Cod sursa (job #3156560)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, a[100001], i, q[100001], p, st, dr, mij, poz, d[100001], v[100001];
int main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>a[i];
q[1]=a[1];
p=1;
d[1]=1;
for(i=2; i<=n; i++)
{
if(q[p]>=a[i])
{
st=1;
dr=p;
poz=0;
while(st<=dr)
{
mij=(st+dr)/2;
if(q[mij]>=a[i])
{
dr=mij-1;
poz=mij;
}
else
st=mij+1;
}
q[poz]=a[i];
d[i]=poz;
}
else
{
q[++p]=a[i];
d[i]=p;
}
}
fout<<p<<'\n';
int j=n;
for(i=p; i>=1; i--)
{
while(d[j]!=i)
j--;
v[i]=j;
}
for(i=1; i<=p; i++)
fout<<a[v[i]]<<" ";
return 0;
}