Pagini recente » Monitorul de evaluare | Cod sursa (job #1689997) | Arhiva de probleme | Statistici Pop Rares (Pop_Rares123) | Cod sursa (job #1293746)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int v[100002],i,n,b[100002],a[100002],dr,st,m,sol,k,nr=0,poz,c[100002];
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
k=0;
for(i=1;i<=n;i++)
{
st=1;
dr=k;sol=0;
while(st<=dr)
{
m=(st+dr)/2;
if(v[i]>a[m])
st=m+1;
else
{
sol=m;
dr=m-1;
}
}
if(sol==0)
{
k++;
a[k]=v[i];
b[i]=k;
poz=i;
}
else
{
a[sol]=v[i];
b[i]=sol;
}
}
fout<<k<<'\n';
for(i=poz;i>=1&&k>0;i--)
{
if(b[i]==k)
{
nr++;
c[nr]=v[i];
k--;
}
}
for(i=nr;i>=1;i--)
fout<<c[i]<<" ";
return 0;
}