Pagini recente » Cod sursa (job #1553620) | Cod sursa (job #1102589) | Cod sursa (job #1924700) | Cod sursa (job #677779) | Cod sursa (job #2922508)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("scmax.in");
ofstream fout ("scmax.out");
const int NM = 1e5 + 5;
int a[NM], d[NM], p[NM], n, k;
int main(){
fin >> n;
for (int i = 1; i <= n; i++){
fin >> a[i];
}
d[++k] = a[1];
p[1] = 1;
for (int i = 2; i <= n; i++){
if (a[i] > d[k]){
d[++k] = a[i];
p[i] = k;
}
else{
int l = 1, r = k, ans = k + 1;
while (l <= r){
int mid = (l + r) / 2;
if (d[mid] > a[i]){
r = mid - 1;
ans = mid;
}
else{
l = mid + 1;
}
}
d[ans] = a[i];
p[i] = ans;
}
}
fout << k << '\n';
vector<int>v;
int j = n;
for (int i = k; i >= 1; i--){
while (p[j] != i){
j -= 1;
}
v.push_back(a[j]);
}
for (int i = k - 1; i >= 0; i--){
fout << v[i] << " ";
}
}