Pagini recente » Cod sursa (job #387187) | Cod sursa (job #2306233) | Cod sursa (job #2438623) | Cod sursa (job #935978) | Cod sursa (job #3276333)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
#define int long long
const int NMAX = 5e5 + 5;
int a[NMAX];
signed main()
{
int n, k;
fin >> n >> k;
for(int i = 1; i <= n; i++)
fin >> a[i];
deque<int> dq;
for(int i = 1; i <= k; i++)
{
while(!dq.empty() && a[i] <= a[dq.back()])
dq.pop_back();
dq.push_back(i);
}
int st = 1, dr = k, vmin = a[dq.front()];
for(int i = k + 1; i <= n; i++)
{
while(!dq.empty() && a[i] <= a[dq.back()])
dq.pop_back();
dq.push_back(i);
if(dq.front() == i - k)
dq.pop_front();
if(vmin < a[dq.front()])
{
vmin = a[dq.front()];
st = i - k + 1;
dr = i;
}
}
fout << st << " " << dr << " " << vmin;
return 0;
}