Pagini recente » Profil Cherimoya | Diferente pentru preoni-2007/runda-4/solutii intre reviziile 3 si 34 | Solutii Unirea 2007 | Cod sursa (job #1282076) | Cod sursa (job #2967579)
#include <fstream>
#include <iostream>
using namespace std;
const int N = 100000;
int x[N+1], lung[N+1], val_min[N+1];
ifstream in("scmax.in");
ofstream out("scmax.out");
int caut_bin(int v[], int n, int x){
int st=1, dr=n, res=0;
while(st <= dr){
int m = (st+dr) / 2;
if(v[m] < x){
res = m;
st = m+1;
}
else dr = m-1;
}
return res;
}
void refac_subsirul(int p, int val, int lg){
if(lg == 1){
return;
}
if(x[p] < val && lung[p] == lg-1){
refac_subsirul(p-1, x[p], lung[p]);
out << x[p] << ' ';
}
else
refac_subsirul(p-1, val, lg);
}
int main(){
int n;
in >> n;
for(int i=1; i<=n; i++) in >> x[i];
int n_val_min = 0, pmax = 1;
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[lung[i]] = x[i];
if(lung[i] > lung[pmax]){
pmax = i;
}
}
out << lung[pmax] << '\n';
refac_subsirul(pmax, x[pmax]+1, lung[pmax]+1);
}