Cod sursa(job #2485919)
| Utilizator | Data | 2 noiembrie 2019 10:40:12 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <bits/stdc++.h>
#define N 100001
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, a[N], b[N], k;
void citire(){
fin>>n;
for(int i = 1; i <= n; ++i)
fin>>a[i];
}
void alg(){
for(int i = 2; i <= n; ++i){
if(a[i] > a[i-1] && a[i-1] != b[k] && a[i]!=a[i-1]){
++k;
b[k] = a[i-1];
} else if(a[i] != a[i-1]){
++k;
b[k] = a[i];
}
}
}
void afisare(){
fout<<k<<"\n";
for(int i = 1; i <= k; ++i)
fout<<b[i]<<" ";
}
int main(){
citire();
alg();
afisare();
}
