Pagini recente » Cod sursa (job #1492921) | Cod sursa (job #1094435) | Cod sursa (job #2160292) | Cod sursa (job #1044662) | Cod sursa (job #2800273)
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pf push_front
#define MOD 1000000007
#define NMAX 100005
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
vector < int > v, R;
int main()
{
int n, i, st, dr, mij, r, a[NMAX], best[NMAX] = {0}, prec[NMAX] = {0};
fin >> n;
for(i = 1; i <= n; i++) fin >> a[i];
prec[1] = 0, best[1] = 1, v.pb(1);
for(i = 2; i <= n; i++)
{
if(a[i] > a[v[v.size()-1]]) prec[i] = v[v.size()-1], best[i] = best[prec[i]] + 1, v.pb(i);
else
{
r = 0, st = 0, dr = v.size() - 1;
while(st <= dr)
{
mij = (st + dr) / 2;
if(a[v[mij]] < a[i]) r = mij, st = mij + 1;
else dr = mij - 1;
}
v[r] = i;
if(r == 0) prec[i] = 0, best[i] = 1;
else prec[i] = v[r-1], best[i] = best[prec[i]] + 1;
}
}
for(i = 1; i <= n; i++) if(best[i] == v.size()) break;
while(i != 0) R.pb(a[i]), i = prec[i];
fout << v.size() << '\n';
for(i = R.size() - 1; i >= 0; i--) fout << R[i] << ' ';
return 0;
}