Pagini recente » Cod sursa (job #318967) | Cod sursa (job #1270058) | Cod sursa (job #2544831) | Cod sursa (job #2262353) | Cod sursa (job #2522569)
#include <fstream>
#include <vector>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int main() {
int n;
in >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) in >> a[i];
vector<int> best(n, -1);
vector<int> r(n+1, -1);
r[1] = 0;
int pos = 1;
for (int i = 1; i < n; ++i) {
if (a[i] > a[r[pos]]) {
best[i] = r[pos];
r[++pos] = i;
} else {
for (int j = pos-1; j >= 0; --j)
if (a[i] > a[r[j]] && a[i] < a[r[j+1]]) {
best[i] = r[j];
r[j+1] = i;
break;
}
}
}
out << pos << "\n";
vector<int> sol;
int crr = r[pos];
while(crr != -1) {
sol.push_back(a[crr]);
crr = best[crr];
}
for (int i = sol.size()-1; i >= 0; --i)
out << sol[i] << " ";
}