Pagini recente » Cod sursa (job #631417) | Cod sursa (job #255960) | Cod sursa (job #1382329) | Cod sursa (job #730205) | Cod sursa (job #3260686)
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
freopen("scmax.in", "r", stdin);
freopen("scmax.out", "w", stdout);
int n;
cin >> n;
vector<int> a(n), seq(n, 1), last(n, -1);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (int i = 1; i < n; ++i) {
for (int j = 0; j < i; ++j) {
if (a[i] > a[j] && seq[i] < seq[j] + 1) {
seq[i] = seq[j] + 1;
last[i] = j;
}
}
}
int target = -1, maxSeq = 0;
for (int i = 0; i < n; ++i) {
if (seq[i] > maxSeq) {
maxSeq = seq[i];
target = i;
}
}
stack<int> nums;
for (int current = target; current != -1; current = last[current]) {
nums.push(a[current]);
}
cout << maxSeq << "\n";
while (!nums.empty()) {
cout << nums.top() << " ";
nums.pop();
}
return 0;
}