Cod sursa(job #3214069)
Utilizator | Branea Tudor Branea | Data | 13 martie 2024 19:09:05 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.81 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n, v[100002], lmax, cnt = 1, st, dr, stmax=1, drmax;
int main()
{
f>>n;
f>>v[1];
for(int i = 2; i <= n+1; i++){
f>>v[i];
if(v[i] > v[i-1]){
cnt++;
dr = i;
}
else{
if(v[i] == v[i-1]){
cnt = cnt;
dr = i;
}
else{
if(cnt > lmax){
lmax = cnt;
stmax = st;
drmax = dr;
}
cnt = 1;
st = i;
}
}
}
g<<lmax<<'\n';
for(int i = stmax; i <= drmax; i++)
{
if(v[i] != v[i-1])
g<<v[i]<<' ';
}
}