Cod sursa(job #3200821)
| Utilizator | Data | 5 februarie 2024 20:15:28 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#include <algorithm>
using namespace std;
const int Vmax = 100001;
int a[Vmax];
int minVal[Vmax];
int lMax;
int main(){
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n;
fin>>n;
for(int i=1;i<=n;i++)
fin>>a[i];
for(int i=1;i<=n;i++){
if(minVal[lMax] < a[i]){
lMax++;
minVal[lMax] = a[i];
}
else{
int poz = upper_bound(minVal[1], minVal[lMax+1], a[i]);
minVal[poz] = a[i];
}
}
fout<<lMax<<'\n';
for(int i=1;i<=lMax;i++)
fout<<minVal[i]<<" ";
}