Pagini recente » Cod sursa (job #1276523) | Cod sursa (job #1048531) | Cod sursa (job #995317) | Cod sursa (job #1025072) | Cod sursa (job #3339438)
#include <bits/stdc++.h>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
const int NMAX = 1e5 + 1;
int n, dp[NMAX], tati[NMAX], v[NMAX], maxim, sol, pos, posol;
void drum(int posol) {
if (posol != 0) {
drum(tati[posol]);
out << v[posol] << " ";
}
}
int main()
{
in >> n;
for (int i = 1; i <= n; ++i)
in >> v[i];
dp[1] = 1;
for (int i = 2; i <= n; ++i){
int maxim = 0;
for (int j = 1; j < i; ++j) {
if (v[j] < v[i] && maxim < dp[j]) {
pos = j;
maxim = dp[j];
}
}
dp[i] = maxim + 1;
if (dp[i] != 1)
tati[i] = pos;
if (sol < dp[i]) {
sol = dp[i];
posol = i;
}
}
out << sol << "\n";
drum(posol);
return 0;
}