Pagini recente » Cod sursa (job #3246661) | Cod sursa (job #2359169) | Cod sursa (job #61833) | Cod sursa (job #2483488) | Cod sursa (job #3283748)
#include <iostream>
#include <random>
#include <fstream>
#include <stack>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int a[1005], dp[1005], urm[1005];
int main()
{
int n;
fin >> n;
for (int i = 1; i <= n; i++)
fin >> a[i];
dp[n] = 1;
urm[n] = n + 1;
for (int i = n - 1; i >= 1; i--)
{
dp[i] = 1;
int maxx = 0, pos = n + 1;
for (int j = i + 1; j <= n; j++)
if (a[i]<a[j] && dp[j]>maxx)
maxx = dp[j], pos = j;
dp[i]+=maxx;
urm[i] = pos;
}
int max1 = 0;
int start;
for (int i = 1; i <= n; i++)
if (dp[i] > max1)
max1 = dp[i], start = i;
fout << max1 << "\n";
while (start != n + 1)
{
fout << a[start] << " ";
start = urm[start];
}
return 0;
}