Pagini recente » Cod sursa (job #1232819) | Cod sursa (job #1132988) | Cod sursa (job #2876605) | Cod sursa (job #2505562) | Cod sursa (job #2759443)
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 500001;
int n,k;
int hmax=-30003,a,b;
int v[NMAX];
deque<int>q;
int main(){
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
scanf("%d %d",&n,&k);
for(int i=1;i<=n;i++){
scanf("%d",&v[i]);
while(!q.empty() && v[i] < v[q.back()]){
q.pop_back();
}
q.push_back(i);
if(i-q.front()>=k){
q.pop_front();
}
if(i>=k){
if(hmax < v[q.front()]){
hmax = v[q.front()];
a = i - k+1;
b = i;
}
}
}
printf("%d %d %d",a,b,hmax);
return 0;
}