Pagini recente » Cod sursa (job #1232166) | Cod sursa (job #3194545) | Autentificare | Cod sursa (job #755708) | Cod sursa (job #2680159)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("scmax.in");
ofstream fout ("scmax.out");
const int max_n = 1e5 + 1;
int dp[max_n], p[max_n], v[max_n], ans[max_n];
int Sclm(int n)
{
int k = 1;
dp[1] = v[1];
p[1] = 1;
for(int i = 2; i <= n; ++i) {
if(v[i] > dp[k]) {
dp[++k] = v[i];
p[i] = k;
}
else {
int st = 1, dr = k, poz = k + 1;
while(st <= dr) {
int mij = (st + dr) / 2;
if(dp[mij] >= v[i]) {
poz = mij;
dr = mij - 1;
}
else
st = mij + 1;
}
p[i] = poz;
dp[poz] = v[i];
}
}
return k;
}
int main()
{
int n; fin >> n;
for(int i = 1; i <= n; ++i)
fin >> v[i];
int k = Sclm(n);
int j = n;
for(int i = k ; i >= 1 ; i --)
{
while(p[j] != i)
j --;
ans[i] = j;
}
fout << k << "\n";
for(int i = 1; i <= k; i++)
fout << v[ans[i]] << " ";
return 0;
}