Cod sursa(job #2906334)
Utilizator | Data | 25 mai 2022 17:44:18 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.9 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int main()
{
int n, nr[100001], s=1, smax=0, st=1, stmax, finmax;
fin>>n;
fin>>nr[1];
for(int i=2; i<=n; i++)
{
fin>>nr[i];
if(nr[i]<nr[i-1])
{
if(s>smax)
{
smax=s;
stmax=st;
finmax=i;
}
st=i;
s=1;
}
else
if(nr[i]>nr[i-1])
s++;
}
if(s>smax)
{
smax=s;
stmax=st;
finmax=n;
}
cout<<stmax<<" "<<finmax;
fout<<smax<<endl<<nr[stmax]<<" ";
for(int j=stmax+1; j<=finmax; j++)
if(nr[j-1]<nr[j])
fout<<nr[j]<<" ";
return 0;
}