Pagini recente » Cod sursa (job #876757) | Cod sursa (job #2630386) | Cod sursa (job #100830) | Cod sursa (job #2817067) | Cod sursa (job #2895238)
#include<bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, v[200005], dp[200005], pozitii[200005];
vector<int>ans;
int main()
{
fin >> n;
for (int i = 1; i <= n; i++)
fin >> v[i];
dp[1] = v[1];
int nr_elem = 1;
pozitii[1] = 1;
for (int i = 2; i <= n; i++) {
if (v[i] > dp[nr_elem]) {
dp[++nr_elem] = v[i];
pozitii[i] = nr_elem;
continue;
}
int st = 1, dr = nr_elem, poz = 0;
while (st <= dr) {
int mijl = (st + dr) / 2;
if (dp[mijl] >= v[i]) {
dr = mijl - 1;
poz = mijl;
} else {
st = mijl + 1;
}
}
dp[poz] = v[i];
pozitii[i] = poz;
}
fout << nr_elem << '\n';
int curr_poz = n;
for (int i = nr_elem; i >= 1; i--) {
while (pozitii[curr_poz] != i)
curr_poz--;
ans.push_back(v[curr_poz]);
}
reverse(ans.begin(), ans.end());
for (auto it:ans)
fout << it << " ";
return 0;
}