Pagini recente » Cod sursa (job #2050377) | Cod sursa (job #2340985) | Cod sursa (job #879668) | Cod sursa (job #553197) | Cod sursa (job #2569605)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
vector <int> v;
vector <pair<int,int>> dp;
vector <int> sol;
int maxi, p;
void solutie(int p)
{
if (dp[p].second >= 0) {
sol.push_back(v[p]);
solutie(dp[p].second);
}
else sol.push_back(v[p]);
}
void scmax()
{
dp.resize(v.size());
dp[0].first = 1;
dp[0].second = -1;
for (int i = 1; i < v.size(); i++) {
dp[i].first = 1;
dp[i].second = -1;
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 = j;
}
}
}
}
int maxi = 0, p;
for (int i = 0; i < dp.size(); i++) {
if (dp[i].first > maxi) {
maxi = dp[i].first;
p = i;
}
}
fout << maxi << endl;
solutie(p);
for (int i = sol.size() - 1; i >= 0; i--) fout << sol[i] << " ";
}
int main()
{
int n, x;
fin >> n;
for (int i = 0; i < n; i++) {
fin >> x;
v.push_back(x);
}
scmax();
fin.close();
fout.close();
}