Pagini recente » Cod sursa (job #187546) | Cod sursa (job #2019804) | Cod sursa (job #1239573) | Cod sursa (job #2800805) | Cod sursa (job #2034191)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int m[100001],prec[100001];
int main()
{
int v[100001],n,i;
f>>n;
for(i=1;i<=n;i++)f>>v[i],m[i]=i;
int st,dr,mij,poz,k=0;
for(i=1;i<=n;i++)
{
st=1,dr=k;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[i]>v[m[mij]])st=mij+1;
else dr=mij-1;
}
m[st]=i;
prec[i]=m[st-1];
if(st>k)
{
k++;
poz=i;
}
}g<<k<<"\n";
for(i=1;i<=k;i++)g<<v[m[i]]<<" ";
return 0;
}