Pagini recente » Cod sursa (job #2735019) | Cod sursa (job #3186279) | Cod sursa (job #2285775) | Cod sursa (job #2039982) | Cod sursa (job #3280418)
#include <bits/stdc++.h>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
const int NMAX = 1e5 + 5;
int v[NMAX + 5];
int d[NMAX + 5];
int l;
int n;
int catare(int x)
{
int pos = 0;
for(int step = 1 << 15; step > 0; step >>= 1)
{
if(pos + step <= d[0] && d[pos + step] < x)
{
pos += step;
}
}
return pos;
}
void solve()
{
d[1] = v[1];
d[0] = 1;
for(int i = 2; i <= n; ++i)
{
int pos = catare(v[i]);
if(pos == d[0])
{
++d[0];
}
d[pos + 1] = v[i];
}
out << d[0] << '\n';
for(int i = 1; i <= d[0]; ++i)
{
out << d[i] << ' ';
}
}
int main()
{
in >> n;
for(int i = 1; i <= n; ++i)
{
in >> v[i];
}
solve();
return 0;
}