Cod sursa(job #2528912)
Utilizator | Data | 22 ianuarie 2020 19:07:43 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in"); ofstream fout("scmax.out");
int sc[100010], n, a[100010], l;
string subsir[100010];
int main() {
fin>>n;
for(int i=0; i<n; i++){
fin>>a[i];
}
for(int i=0; i<n; i++){
for(int j=0; j<=l; j++){
if( (a[i]<sc[j+1] && a[i]>sc[j]) || (j>=l && a[i]>sc[j]) ){
subsir[j+1]=subsir[j]+to_string(a[i])+" ";
sc[j+1]=a[i]; l=max(j+1, l);
}
}
}
fout<<l<<"\n"<<subsir[l];
}