Pagini recente » Cod sursa (job #1156248) | Cod sursa (job #1896878) | Cod sursa (job #1945221) | Cod sursa (job #2438720) | Cod sursa (job #1414783)
#include<cstdio>
#include<deque>
#include<cstring>
using namespace std;
int v[500001],n,k,ad,ci,cs,mini;
deque<int>D;
char s[3500005];
void citire(){
int c=0,lung;
bool pp;
lung=strlen(s)-1;
for(int i=1;i<=n;i++){
pp=false;
if(s[c]=='-'){
pp=true;
c++;
}
while(s[c]>='0'&&s[c]<='9'){
v[i]=v[i]*10+s[c]-'0';
c++;
}
if(pp==true)
v[i]*=(-1);
while(s[c]==' ')
c++;
}
}
int main(){
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
scanf("%d%d\n",&n,&k);
/*for(int i=1;i<=n;i++)
scanf("%d",&v[i]);*/
gets(s);
citire();
for(int i=1;i<=k;i++){
ad=i;
while(!D.empty()&&v[D.back()]>v[ad])
D.pop_back();
D.push_back(ad);
}
mini=v[D.front()];
ci=1;
cs=k;
for(int i=2;i<=n-k+1;i++){
while(!D.empty()&&D.front()<i)
D.pop_front();
ad=i+k-1;
while(!D.empty()&&v[D.back()]>v[ad])
D.pop_back();
D.push_back(ad);
if(v[D.front()]>mini){
mini=v[D.front()];
ci=i;
cs=i+k-1;
}
}
printf("%d %d %d",ci,cs,mini);
return 0;
}