Pagini recente » Cod sursa (job #2421043) | Cod sursa (job #661034) | Cod sursa (job #1897972) | Cod sursa (job #2634402) | Cod sursa (job #3040257)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream in ("scmax.in");
ofstream out ("scmax.out");
const int max_size = 1e5 + 1, INF = 2e9 + 1;
int v[max_size], poz[max_size], dp[max_size];
int main ()
{
int n, pozmax = 0;
in >> n;
for (int i = 1; i <= n; i++)
{
poz[i] = INF;
}
for (int i = 1; i <= n; i++)
{
in >> v[i];
int st = 0, e = 0;
while ((1 << (e + 1)) <= pozmax)
{
e++;
}
while (e >= 0)
{
if (st + (1 << e) <= pozmax && poz[st + (1 << e)] < v[i])
{
st += (1 << e);
}
e--;
}
dp[i] = st + 1;
poz[dp[i]] = min(poz[dp[i]], v[i]);
pozmax = max(pozmax, dp[i]);
}
out << pozmax << '\n';
vector <int> ans;
for (int i = n; i > 0; i--)
{
if (dp[i] == pozmax)
{
ans.push_back(v[i]);
pozmax--;
}
}
reverse(ans.begin(), ans.end());
for (auto f : ans)
{
out << f << " ";
}
in.close();
out.close();
return 0;
}