Cod sursa(job #2382186)
Utilizator | Data | 17 martie 2019 20:30:28 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
using namespace std;
int v[100001];
int main()
{
int n,i,lmax,ls,p=0,t=0;
cin>>n;
for (i=1; i<=n; i++)
cin>>v[i];
lmax=0; ls=0;
for (i=1; i<=n; i++)
{
if (v[i]<v[i+1])
{
ls++;
if (ls>=lmax)
{
lmax=ls; p=i;
}
else
ls=0;
t=v[i];
}
}
cout<<p-lmax+1<<" ";
cout<<endl;
cout<<t<<" ";
}