Cod sursa(job #3185366)
| Utilizator | Data | 18 decembrie 2023 19:43:26 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 65 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
const int nmax = 100005;
int n, min_val[nmax], a[nmax], len;
int main()
{
f >> n;
for(int i = 1; i <= n; i ++)
f >> a[i];
for(int i = 1; i <= n; i ++)
{
int p = lower_bound(min_val + 1, min_val + len + 1, a[i]) - min_val;
if(p > len)
len ++;
min_val[p] = a[i];
}
g << len << '\n';
for(int i = 1; i <= len; i ++)
g << min_val[i] << " ";
return 0;
}
