Pagini recente » Cod sursa (job #1264861) | Cod sursa (job #2193257) | Cod sursa (job #1344368) | Cod sursa (job #2808906) | Cod sursa (job #1815664)
#include <iostream>
#include <cstdio>
#include <deque>
using namespace std;
int a[500005];
int n, k;
deque <int> dq;
int pi,pf,vmin=-40000;
int main()
{
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
scanf("%d %d\n", &n, &k);
scanf("%d", &a[1]);
for(int i=2;i<=n;i++)
scanf(" %d", &a[i]);
dq.push_back(1);
for(int i=2;i<k;i++)
{
while(!dq.empty() && a[dq.back()]>a[i])
dq.pop_back();
dq.push_back(i);
}
for(int i=k;i<=n;i++)
{
while(!dq.empty() && a[dq.back()]>=a[i])
dq.pop_back();
while(!dq.empty() && dq.front()+k<=i)
dq.pop_front();
dq.push_back(i);
if(a[dq.front()]>vmin)
{
vmin=a[dq.front()];
pi=dq.front();
pf=i;
}
}
printf("%d %d %d", pi,pf,vmin);
return 0;
}