Pagini recente » Cod sursa (job #2509223) | Cod sursa (job #2509214) | Cod sursa (job #275743) | Cod sursa (job #2035182) | Cod sursa (job #2966864)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int val_min[100001], n, x[100001], lung[100001], pmax;
void refac_subsir(int p, int l, int val){
if(p == 0)
return;
if(lung[p] == l && x[p] < val){
refac_subsir(p-1, l-1, x[p]);
fout << x[p] <<' ';
}
else
refac_subsir(p-1, l, val);
}
int caut_bin(int v[], int n, int val){
///caut cel mai mare i cu v[i] < val
int st = 1, dr = n, rez = 0;
while(st <= dr){
int m = (st + dr) / 2;
if(v[m] < val){
rez = m;
st = m + 1;
}
else{
dr = m-1;
}
}
return rez;
}
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
fin >> x[i];
int n_val_min = 0;
for(int i = 1; i <= n; i++){
int j0 = caut_bin(val_min, n_val_min, x[i]);
if(j0 == n_val_min){
n_val_min ++;
}
lung[i] = 1 + j0;
val_min[1 + j0] = x[i];
if(lung[i] > lung[pmax])pmax = i;
}
fout<< lung[pmax] << endl;
refac_subsir(pmax, lung[pmax], x[pmax+1]);
return 0;
}