Pagini recente » Cod sursa (job #2759116) | Cod sursa (job #646233) | Cod sursa (job #2897270) | Cod sursa (job #733508) | Cod sursa (job #2578527)
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int v[100005], n, pre[100005], best[100005], res = 1;
void citire() {
fin >> n;
for(int i = 1; i<= n; i++)
fin >> v[i];
}
void solve() {
best[1] = 1;
for(int i = 2; i <= n; i++) {
best[i] = 1;
for(int j = 1; j < i; j++)
if(v[j] < v[i] && best[i] < best[j]+1) {
pre[i] = j;
best[i] = best[j]+1;
}
if(best[res] < best[i]) res = i;
}
fout << best[res] << '\n';
}
void afis(int a) {
if(!a) return;
afis(pre[a]);
fout << v[a] << ' ';
}
int main() {
citire();
solve();
afis(res);
}