Pagini recente » Cod sursa (job #1538126) | Cod sursa (job #1938908) | Cod sursa (job #1267575) | Cod sursa (job #2620536) | Cod sursa (job #2211002)
#include <cstdio>
#include <fstream>
#include <cstring>
using namespace std;
const int SZ=(1<<23);
int pointer=SZ;
char buffer[SZ];
char advance()
{
if(pointer==SZ)
{
fread(buffer,1,SZ,stdin);
pointer=0;
}
return buffer[pointer++];
}
int read()
{
int answer=0;
char ch=advance();
while(!isdigit(ch))
ch=advance();
while(isdigit(ch))
{
answer=answer*10+ch-'0';
ch=advance();
}
return answer;
}
const int nmax=500000;
int n,k,v[nmax+5];
int deq[nmax+5],st=1,dr=0;
int best=-1e9,st_sol,dr_sol;
int main()
{
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
n=read();
k=read();
for(int i=1;i<=n;i++)
{
v[i]=read();
if(st<=dr and i-deq[st]+1>k)
st++;
while(st<=dr and v[i]<=v[deq[dr]])
dr--;
deq[++dr]=i;
if(i>=k and v[deq[st]]>best)
{
best=v[deq[st]];
st_sol=i-k+1;
dr_sol=i;
}
}
printf("%d %d %d",st_sol,dr_sol,best);
return 0;
}