Pagini recente » Cod sursa (job #2781091) | Cod sursa (job #1505645) | Cod sursa (job #1572844) | Cod sursa (job #1018992) | Cod sursa (job #3155792)
#include <fstream>
using namespace std;
ifstream in ("scmax.in");
ofstream out ("scmax.out");
const int max_size = 1e5 + 1, INF = 2e9 + 1;
int v[max_size], best[max_size], ans[max_size], dp[max_size];
int main ()
{
int n, mx = 0;
in >> n;
for (int i = 1; i <= n; i++)
{
in >> v[i];
best[i] = INF;
}
for (int i = 1; i <= n; i++)
{
int e = 20, st = 0;
while (e >= 0)
{
if (st + (1 << e) <= mx && best[st + (1 << e)] < v[i])
{
st += (1 << e);
}
e--;
}
dp[i] = st + 1;
best[dp[i]] = min(best[dp[i]], v[i]);
mx = max(mx, dp[i]);
}
out << mx << '\n';
int j = mx;
for (int i = n; i > 0; i--)
{
if (dp[i] == j)
{
ans[j] = v[i];
j--;
}
}
for (int i = 1; i <= mx; i++)
{
out << ans[i] << " ";
}
in.close();
out.close();
return 0;
}