Pagini recente » Cod sursa (job #997808) | Cod sursa (job #675783) | Cod sursa (job #2369623) | Cod sursa (job #2038905) | Cod sursa (job #1803720)
#include <iostream>
#include <cstdio>
#include <deque>
#define MAX 500005
#define cout cerr
using namespace std;
int n,k,a[MAX],val;
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",&a[i]);
val=1;
for(int i=1; i<=n; i++)
{
while(!q.empty() && a[q.back()]>=a[i])
q.pop_back();
if(!q.empty() && q.front()+k<=i)
q.pop_front();
q.push_back(i);
if(i>=k)
if(a[q.front()]>a[val])
val=i;
}
printf("%d %d %d",val-k+1,val,a[val]);
return 0;
}