Pagini recente » Cod sursa (job #1329299) | Cod sursa (job #2372509) | Cod sursa (job #1064779) | Cod sursa (job #527571) | Cod sursa (job #2296050)
#include <iostream>
#include <fstream>
#include <algorithm>
#define Nmax 100001
using namespace std;
ifstream si("scmax.in");
ofstream so("scmax.out");
int n,a[1000007],dp[100007],t[100007];
void afis(int m) {
if(m) {
afis(t[m]);
so<<a[m]<<' ';
}
}
int main() {
si>>n;
for(int i=1;i<=n;i++)
si>>a[i];
dp[1]=1;
int k=1;
for(int i=2;i<=n;i++) {
int st=1,dr=k;
while(st<=dr) {
int m=(st+dr)/2;
if(a[dp[m]]<a[i])
st=m+1;
else
dr=m-1;
}
if(st>k)
k++;
dp[st]=i;
t[i]=dp[st-1];
}
so<<k<<'\n';
afis(dp[k]);
return 0;
}