Pagini recente » Cod sursa (job #2777554) | Cod sursa (job #700830) | Cod sursa (job #235100) | Cod sursa (job #2548875) | Cod sursa (job #2813002)
#include <bits/stdc++.h>
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
int n,k,maxim = -1e9,st,dr,x;
deque<pair<int,int>>d;
int main()
{
ios_base::sync_with_stdio(false);
in.tie(NULL);
out.tie(NULL);
in >> n >> k;
for (int i = 1; i <= n; i++)
{
in >> x;
while (d.size() and d.front().second < i - k + 1)
d.pop_front();
while (d.size() and d.back().first >= x)
d.pop_back();
d.push_back(make_pair(x,i));
if (i >= k and d.front().first > maxim)
{
maxim = d.front().first;
st = i - k + 1;
dr = i;
}
}
out << st << " " << dr << " " << maxim;
return 0;
}