Cod sursa(job #2423107)
| Utilizator | Data | 20 mai 2019 19:24:31 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 65 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <bits/stdc++.h>
using namespace std;
int sclm[100001], i, n, x, st, dr, mij, k;
int main()
{
ifstream f("scmax.in");
ofstream g("scmax.out");
f >> n;
for(i = 1; i <= n; ++ i)
{
f >> x;
if(x > sclm[k]) sclm[++ k] = x;
else
{
st = 1;
dr = k;
while(st <= dr)
{
mij = (st + dr) / 2;
if(sclm[mij] >= x) dr = mij - 1;
else st = mij + 1;
}
sclm[st] = x;
}
}
g << k << "\n";
for(i = 1; i <= k; ++ i)
g << sclm[i] << " ";
return 0;
}
