Pagini recente » Cod sursa (job #960430) | Cod sursa (job #1857451) | Cod sursa (job #2127229) | Cod sursa (job #2455585) | Cod sursa (job #3142002)
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
const int dim = 5e5 + 5;
int n, v[dim], k, maxi = INT_MIN, dr;
deque<int>dq;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int32_t main()
{
fin >> n >> k;
for(int i = 1; i <= n; ++i)
{
fin >> v[i];
}
for(int i = 1; i <= k; ++i)
{
while(dq.size() > 0 && v[dq.back()] >= v[i])
{
dq.pop_back();
}
dq.push_back(i);
}
maxi = v[dq.back()], dr = k;
for(int i = k + 1; i <= n; ++i)
{
while(dq.size() > 0 && dq.front() <= i - k)
{
dq.pop_front();
}
while(dq.size() > 0 && v[dq.back()] >= v[i])
{
dq.pop_back();
}
dq.push_back(i);
if(v[dq.front()] > maxi)
{
maxi = v[dq.front()];
dr = i;
}
}
fout << dr - k + 1 << " " << dr << " " << maxi;
return 0;
}