Pagini recente » Cod sursa (job #2328862) | Cod sursa (job #536083) | Cod sursa (job #698785) | Cod sursa (job #172187) | Cod sursa (job #2572823)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("scmax.in");
ofstream fout ("scmax.out");
void usain_bolt()
{
ios::sync_with_stdio(false);
fin.tie(0);
}
const int N = 1e5 + 5;
int a[N], dad[N], f[N];
int bs(int x)
{
int left = 1, right = f[N - 1], mx = 0;
while(left <= right) {
int mid = (left + right) >> 1;
if(x > a[f[mid]]) mx = max(mx, mid), left = mid + 1;
else right = mid - 1;
}
return mx;
}
void path(int k)
{
if(dad[k] == 0) fout << a[k] << " ";
else {
path(dad[k]);
fout << a[k] << " ";
}
}
int main()
{
usain_bolt();
int n;
fin >> n;
for(int i = 1; i <= n; ++i) fin >> a[i];
f[++f[N - 1]] = 1;
for(int i = 2; i <= n; ++i) {
int pos = bs(a[i]);
dad[i] = f[pos];
f[pos + 1] = i;
f[N - 1] = max(f[N - 1], pos + 1);
}
fout << f[N - 1] << "\n";
path(f[f[N - 1]]);
return 0;
}