Pagini recente » Cod sursa (job #1918403) | Cod sursa (job #2375666) | Cod sursa (job #473542) | Cod sursa (job #1094416) | Cod sursa (job #2566861)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
vector <int> v;
vector <pair<int, vector<int>>> dp;
int maxi = 0;
void scmax()
{
dp.resize(v.size());
dp[0].first = 1;
dp[0].second.push_back(v[0]);
for (int i = 1; i < v.size(); ++i) {
dp[i].first = 1;
dp[i].second.push_back(v[i]);
for (int j = 0; j < i; ++j) {
if (v[j] < v[i]) {
if (dp[j].first + 1 > dp[i].first) {
dp[i].first = dp[j].first + 1;
dp[i].second.push_back(v[j]);
}
}
}
}
for (int i = 0; i < dp.size(); i++) {
if (dp[i].first > maxi) maxi = i;
}
}
int main()
{
int n, x;
fin >> n;
for (int i = 0; i < n; i++) {
fin >> x;
v.push_back(x);
}
scmax();
sort(dp[maxi].second.begin(), dp[maxi].second.end());
fout << dp[maxi].second.size() << endl;
for (auto t : dp[maxi].second) fout << t << " ";
fin.close();
fout.close();
}