Pagini recente » Cod sursa (job #2901289) | Cod sursa (job #1078734) | Cod sursa (job #1722778) | Cod sursa (job #2108537) | Cod sursa (job #2966853)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int val_min[101], n, x[101], lung[101], pmax;
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;
for(int i = 1; i <= n_val_min; i++)
fout << val_min[i] << ' ';
return 0;
}