Pagini recente » Cod sursa (job #1580229) | Cod sursa (job #2165426) | Cod sursa (job #2196609) | Cod sursa (job #2238926) | Cod sursa (job #2324472)
#include <iostream>
#include <fstream>
using namespace std;
int n,v[100005],lg[100005],pred[100005],lgmax;
ifstream in("scmax.in");
ofstream out("scmax.out");
int main()
{
in>>n;
for(int i=1;i<=n;i++) in>>v[i];
for(int i=1;i<=n;i++)
{
int st=1, dr=lgmax;
while(st<=dr)
{
int mij=(st+dr)/2;
if(v[lg[mij]]<v[i]) st=mij+1;
else dr=mij-1;
}
if(st>lgmax) lgmax++;
lg[st]=i;
pred[i]=lg[st-1];
}
out<<lgmax<<'\n';
int poz=lgmax-1, cur=lg[lgmax];
while(cur>0)
{
lg[poz]=pred[cur];
cur=pred[cur];
poz--;
}
for(int i=1;i<=lgmax;i++) out<<v[lg[i]]<<" ";
return 0;
}