Pagini recente » Cod sursa (job #1287506) | Cod sursa (job #2194565) | Cod sursa (job #1304245) | Cod sursa (job #2683737) | Cod sursa (job #3184142)
#include <fstream>
using namespace std;
int n;
int v[200005];
int dp[200005];
int prev_e[200005];
int sol[200005];
ifstream f("scmax.in");
ofstream g("scmax.out");
int main() {
f >> n;
for (int i = 1; i <= n; i++) {
f >> v[i];
}
dp[1] = 1;
for (int i = 2; i <= n; i++) {
int Max = 0;
int prev_el = 0;
for (int j = 1; j < i; j++ ){
if (v[j] < v[i] && Max < dp[j]) {
Max = dp[j];
prev_el = j;
}
dp[i] = Max + 1;
prev_e[i] = prev_el;
}
}
int Max = 0;
int ss = 0;
for (int i = 1; i <= n; i++) {
if (Max < dp[i]) {
Max = dp[i];
ss = i;
}
}
g << Max << '\n';
int idx = 1;
while(ss != 0) {
sol[idx++] = ss;
ss = prev_e[ss];
}
for (int i = Max; i >= 1; i--) {
g << v[sol[i]] << " ";
}
}