Pagini recente » Cod sursa (job #95552) | Cod sursa (job #105325) | Cod sursa (job #1336727) | Cod sursa (job #1567766) | Cod sursa (job #2938008)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, v[100001];
int lung[100001];
void refac_subsirul(int p, int val, int l){
if(l == 0)
return;
if(v[p] <= val && lung[p] == l){
refac_subsirul(p - 1, val - 1, l - 1);
fout << v[p] << " ";
}else
refac_subsirul(p - 1, val, l);
}
int main()
{
fin >> n;
for(int i = 0; i < n; i++)
fin >> v[i];
int p = 0;
for(int i = 0; i < n; i++){
lung[i] = 0;
for(int j = 0; j < i; j++){
if(v[j] < v[i])
lung[i] = max(lung[i], lung[j]);
}
lung[i]++;
if(lung[i] > lung[p])
p = i;
}
fout << lung[p] << "\n";
refac_subsirul(p, v[p], lung[p]);
return 0;
}