Cod sursa(job #2574729)
| Utilizator | Data | 6 martie 2020 09:24:48 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 55 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.95 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
#define NMAX 100005
int main()
{
int a[NMAX];
int b[NMAX];
int n;
fin>>n;
for(int i=1;i<=n;i++)
fin>>a[i];
int k = 1;
b[k] = a[1];
for(int i=2;i<=n;i++)
{
if(a[i] > b[k])
{
b[++k] = a[i];
}
else
{
int st = 1;
int dr = k;
int poz = dr+1;
while(st<=dr)
{
int m = (st+dr)/2;
if(b[m] > a[i])
{
poz = m;
dr = m-1;
}
else
{
st = m+1;
}
}
b[poz] = a[i];
}
}
fout<<k<<'\n';
for(int i=1;i<=k;i++)
fout<<b[i]<<" ";
return 0;
}
