Pagini recente » Cod sursa (job #577122) | Cod sursa (job #2154355) | Cod sursa (job #3137802) | Cod sursa (job #3332030) | Cod sursa (job #3307367)
#include <bits/stdc++.h>
using namespace std;
signed main()
{
freopen("secventa.in", "r", stdin);
freopen("secventa.out", "w", stdout);
cin.tie(nullptr)->sync_with_stdio(false);
int n, k;
long long mx = -100000, mi = -1;
cin >> n >> k;
deque<pair<int, int>> d;
for(int i = 1; i <= n; i++)
{
int x;
cin >> x;
while(!d.empty() && d.back().first > x)
{
d.pop_back();
}
while(!d.empty() && d.front().second <= i - k)
{
d.pop_front();
}
d.push_back({x, i});
if(i >= k)
{
if(mx < d.front().first)
{
mx = d.front().first;
mi = i - k + 1;
}
}
}
cout << mi << " " << mi + k - 1 << " " << mx;
}