Pagini recente » Cod sursa (job #468751) | Borderou de evaluare (job #1915511) | Cod sursa (job #1394860) | Cod sursa (job #976050) | Cod sursa (job #1898497)
#include <iostream>
#include <fstream>
using namespace std;
unsigned long long n,k,i,j;
long long v[500007],minc,maxmin=-30000,ls,ld;
int main()
{
ifstream fin ("secventa.in");
ofstream fout ("secventa.out");
fin>>n>>k;
for (i=1;i<k;++i){
fin>>v[i];
}
for (i=k;i<=n;++i){
fin>>v[i];
minc=30000;
for(j=i;j>=i-k+1;--j){
if (minc>v[j])
minc=v[j];}
if(minc>maxmin){
maxmin=minc;
ls=i-k+1;
ld=i;
}}
fout<<ls<<" "<<ld<<" "<<maxmin;
return 0;
}