Pagini recente » Cod sursa (job #2428452) | Cod sursa (job #33361) | Cod sursa (job #1945091) | Cod sursa (job #178493) | Cod sursa (job #2519691)
#include <fstream>
#include <vector>
using namespace std;
int n;
int v[100001];
long long dp[100001], l = 0;
vector<int> ans[100001];
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int main()
{
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> v[i];
dp[i] = 2000000000;
}
for (int i = 1; i <= n; i++)
{
for (int j = l; j >= 0; j--)
{
if (dp[j] < v[i] && v[i] < dp[j + 1])
{
dp[j + 1] = v[i];
if (j == l)
l++;
for (int x = j+1; x >= 1; x--)
{
ans[j+1].push_back(dp[x]);
}
break;
}
}
}
cout << l << "\n";
for (int i = l-1; i >=0; i--)
{
cout << ans[l][i] << " ";
}
return 0;
}