Pagini recente » Cod sursa (job #2327922) | Cod sursa (job #1404246) | Cod sursa (job #3170205) | Cod sursa (job #2135527) | Cod sursa (job #3174378)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, arr[100005];
int dp[100005];
void los() {
int maxim = -1;
for (int i = n; i > 0; i--) {
dp[i] = 1;
for (int j = i + 1; j <= n; j++)
if (arr[i] < arr[j]) {
dp[i] = max(dp[i], dp[j] + 1);
maxim = max(maxim, dp[i]);
}
}
fout << maxim << "\n";
for (int i = 1; i <= n; i++)
if (dp[i] == maxim) {
fout << arr[i] << " ";
maxim--;
}
}
int main() {
fin >> n;
for (int i = 1; i <= n; i++)
fin >> arr[i];
los();
}