Pagini recente » Cod sursa (job #2841465) | Cod sursa (job #152377) | Cod sursa (job #1304515) | Cod sursa (job #583733) | Cod sursa (job #860698)
Cod sursa(job #860698)
#include<cstdio>
#include<deque>
#define NMax 5000005
using namespace std;
deque <int> v;
int a[NMax],sum;
int main ()
{
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
int i,n,k,max=-30005,s1,s2;
scanf("%d%d",&n,&k);
for (i=1; i<=n; i++)
scanf("%d",&a[i]);
for (i=1; i<=n; i++)
{
while (!v.empty() && a[v.back()]>a[i])
v.pop_back();
v.push_back(i);
if (v.front()==i-k)
v.pop_front();
if (i>=k && a[v.front()]>max)
{
max=a[v.front()];
s1=i-k+1;
s2=i;
}
}
printf("%d %d %d",s1,s2,max);
return 0;
}