Pagini recente » Cod sursa (job #1228989) | Cod sursa (job #1693266) | Cod sursa (job #1864717) | Cod sursa (job #730589) | Cod sursa (job #997832)
Cod sursa(job #997832)
#include<stdio.h>
#include<deque>
#define maxn 500005
#define inf 0x3f3f3f3f
#define maxb 8192
using namespace std;
int n,m,L,R,maxc=-inf;
int a[maxn];
deque <int> q;
char buff[maxb];
int pos=0;
int get_int()
{
int nr=0,sgn=1;
while((buff[pos]<'0' || buff[pos]>'9') && buff[pos]!='-')
if(++pos==maxb) fread(buff,1,maxb,stdin),pos=0;
if(buff[pos]=='-') sgn=-1,pos++;
if(pos==maxb) fread(buff,1,maxb,stdin),pos=0;
while(buff[pos]>='0' && buff[pos]<='9')
{
nr=nr*10+buff[pos]-'0';
if(++pos==maxb) fread(buff,1,maxb,stdin),pos=0;
}
return sgn*nr;
}
void read()
{
n=get_int(); m=get_int();
for(int i=1;i<=n;i++) a[i]=get_int();
}
void solve()
{
for(int i=1;i<=n;i++)
{
while(!q.empty() && a[q.back()]>=a[i]) q.pop_back();
q.push_back(i);
if(q.front()==i-m) q.pop_front();
if(maxc<a[q.front()] && i>=m) maxc=a[q.front()],L=i-m+1,R=i;
}
printf("%d %d %d",L,R,maxc);
}
int main()
{
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
read();
solve();
fclose(stdin);
fclose(stdout);
return 0;
}