Cod sursa(job #2381030)
Utilizator | Data | 15 martie 2019 21:18:08 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.76 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,r=0,c,m=0,cc,rr=0,eg=0,egg=0;
f>>n;
int v[n];
for(int i=0;i<n;i++){
f>>v[i];
if(v[i]>=m){
if(m==v[i]){
eg++;
}
m=v[i];
r++;
c=i;
}else {
r=1;
c=i;
m=v[i];
eg=0;
}
if(r>rr){
rr=r;
cc=c;
egg=eg;
}
}
g<<rr-egg<<endl;
g<<v[cc-rr+1]<<" ";
for(int i=cc-rr+2;i<=cc;i++){
if(v[i]>v[i-1]){
g<<v[i]<<" ";
}
}
g.close();
return 0;
}