Pagini recente » Cod sursa (job #719338) | Cod sursa (job #1931101) | Cod sursa (job #213160) | Cod sursa (job #635018) | Cod sursa (job #2498127)
#include <fstream>
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define NMAX 500005
ifstream fin("secventa.in");
ofstream fout("secventa.out");
deque<int> dq;
int v[NMAX];
int maxim = -30005;
int pozmax = -1;
int main()
{
int n,k;
fin>>n>>k;
for(int i=1;i<=n;i++)
{
fin>>v[i];
}
for(int i=1;i<=n;i++)
{
while(!dq.empty() && v[dq.back()] >= v[i])
dq.pop_back();
dq.push_back(i);
if(dq.front() == i-k)
{
dq.pop_front();
}
if(i>=k)
{
if(v[dq.front()] > maxim )
{
maxim = v[dq.front()];
pozmax = dq.front();
}
}
}
fout<<pozmax<<" "<<pozmax + k - 1<<" "<<v[pozmax];
return 0;
}