Pagini recente » Cod sursa (job #1040215) | Cod sursa (job #1655124) | Cod sursa (job #292496) | Cod sursa (job #200276) | Cod sursa (job #3232674)
#include <bits/stdc++.h>
using namespace std;
int a[500005];
int main()
{
ifstream cin("secventa.in");
ofstream cout("secventa.out");
int n, k, i;
cin >> n >> k;
for (i = 1; i <= n; ++i)
cin >> a[i];
int baza = INT_MIN, start = 0;
deque<int> q;
for (i = 1; i <= n; ++i)
{
while (!q.empty() && a[q.front()] > a[i])
q.pop_back();
q.push_back(i);
if (q.front() == i - k) q.pop_front();
if (!q.empty() && i >= k && a[q.front()] > baza)
{
baza = a[q.front()];
start = i;
}
}
cout << start - k + 1 << " " << start << " " << baza;
return 0;
}