Pagini recente » Cod sursa (job #3269722) | Cod sursa (job #2553781) | Cod sursa (job #1814127) | Cod sursa (job #718491) | Cod sursa (job #2966186)
#include <fstream>
#include <vector>
using namespace std;
const int NMAX = 100000;
int n, v[NMAX+1], d[NMAX+1], pre[NMAX+1], len = 1, lenpoz = 0 ,last;
vector <int> sol;
int main()
{
ifstream fin("scmax.in");
ofstream fout("scmax.out");
fin >> n;
for (int i = 0; i < n; i++){
fin >> v[i];
d[i] = 1;
pre[i] = -1;
for (int j = 0; j < i; j++){
if (v[j] < v[i]) {
d[i] = max(d[j] + 1, d[i]);
pre[i] = j;
}
}
if (d[i] > len){
lenpoz = i;
len = d[i];
}
}
fout << len << endl;
last = lenpoz;
while (last != -1){
sol.push_back(v[last]);
last = pre[last];
}
for (int i = sol.size() - 1; i >= 0; i--)
fout << sol[i] << ' ';
return 0;
}