Pagini recente » Cod sursa (job #3229884) | Cod sursa (job #1413256) | Cod sursa (job #2929775) | Cod sursa (job #2089598) | Cod sursa (job #2878817)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
#define DIM 100000
int n, k;
int a[DIM + 1], v[DIM + 1];
//caut binar cel mai din dreapta element a.i a[mid] >= x;
static inline int CautBinarDr(int x) {
int st = 1, dr = k, poz = k + 1;
while(st <= dr) {
int mid = (st + dr) >> 1;
if(x <= a[mid]) {
poz = mid;
dr = mid - 1;
}else {
st = mid + 1;
}
}
return poz;
}
int main() {
fin >> n;
for(int i = 1; i <= n; i++)
fin >> v[i];
a[k = 1] = v[1];
for(int i = 2; i <= n; i++) {
int poz = CautBinarDr(v[i]);
if(poz > k)
k++;
a[poz] = v[i];
}
fout << k << '\n';
for(int i = 1; i <= k; i++)
fout << a[i] << " ";
return 0;
}