Pagini recente » Cod sursa (job #1097537) | Cod sursa (job #444390) | Cod sursa (job #868732) | Cod sursa (job #1808906) | Cod sursa (job #2578548)
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int v[100005], n, pre[100005], lungime[100005], best;
void citire() {
fin >> n;
for(int i = 1; i<= n; i++)
fin >> v[i];
}
void solve() {
for(int i = 1; i <= n; i++) {
int st = 1, dr = best;
while(st <= dr) {
int m = (st+dr)/2;
if(v[lungime[m]] < v[i]) st = m+1;
else dr = m-1;
}
if(st > best) best++;
lungime[st] = i;
pre[i] = lungime[st-1];
}
fout << best << '\n';
}
void afis(int a) {
if(!a) return;
afis(pre[a]);
fout << v[a] << ' ';
}
int main() {
citire();
solve();
afis(lungime[best]);
}