Pagini recente » Cod sursa (job #1949870) | Cod sursa (job #1748562) | Cod sursa (job #5175) | Cod sursa (job #2918972) | Cod sursa (job #858642)
Cod sursa(job #858642)
#include <iostream>
#include <fstream>
#include <cstdio>
using namespace std;
int a[100005];
int L[100005];
int main()
{
//ifstream cin("scmax.in");
//ofstream cout("scmax.out");
freopen("scmax.in", "r", stdin);
freopen("scmax.out", "w", stdout);
int i, j, n, t;
//cin >> n;
scanf("%d", &n);
for (i = 1; i <= n; i++)
//cin >> a[i];
scanf("%d", &a[i]);
t = n;
for (i = n; i >= 1; i--)
{
L[i] = 0;
for (j = i + 1; j <= n; j++)
if (a[j] > a[i] && L[j] > L[i])
L[i] = L[j];
L[i]++;
if (L[i] > L[t])
t = i;
}
//cout << L[t] << '\n';
printf("%d\n", L[t]);
for (i = t + 1; i <= n; i++)
{
if (a[i] > a[t] && L[i] == L[t] - 1)
{
//cout << a[t] << ' ';
printf("%d ", a[t]);
t = i;
}
}
//cout << a[t];
printf("%d", a[t]);
return 0;
}