Pagini recente » Cod sursa (job #2220505) | Cod sursa (job #1235789) | Cod sursa (job #103266) | Cod sursa (job #1580884) | Cod sursa (job #1770382)
#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,i,lung,d[100001],v[100001],st,dr,mid;
int main()
{
fin>>n;
fin>>v[1];
d[1]=1;
lung=1;
for(i=2;i<=n;i++)
{
fin>>v[i];
st=1;
dr=lung;
while(st<=dr)
{
mid=(st+dr)/2;
if(v[d[mid]]>=v[i])
dr=mid-1;
else
st=mid+1;
}
if(st>lung)
lung++;
d[st]=i;
}
fout<<lung<<"\n";
for(i=1;i<=lung;i++)
fout<<v[d[i]]<<" ";
fin.close();
fout.close();
return 0;
}