Pagini recente » Cod sursa (job #2932673) | Cod sursa (job #57478) | Cod sursa (job #523907) | Cod sursa (job #2438223) | Cod sursa (job #1857962)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n, i, j, st, dr, m;
int a[100005], b[100005], c[100005], k;
int sol[100005];
int main()
{
f >> n;
for (i = 1; i <= n; i++)
f >> a[i];
for (i = 1; i <= n; i++)
if (a[i] > b[k])
k++, b[k] = a[i], c[i] = k;
else
{
st = 1, dr = k;
while (st <= dr)
{
m = (st+dr)/2;
if (b[m] < a[i])
st = m+1;
else
dr = m-1;
}
if (st > k) k++;
b[st] = a[i];
c[i] = st;
}
g << k << '\n';
for (i = n; i > 0 && k > 0; i--)
if (c[i] == k)
j++, sol[j] = a[i], k--;
for (i = j; i >= 1; i--)
g << sol[i] << ' ';
return 0;
}