Pagini recente » Rating Alice Palmer (8harperc7622to2) | Cod sursa (job #1134161) | Cod sursa (job #1363740) | Cod sursa (job #889564) | Cod sursa (job #2687773)
#include <bits/stdc++.h>
#define NMAX 500005
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int v[NMAX];
deque<pair<int, int> > dq;
int main()
{
int n, k;
fin >> n >> k;
for(int i = 1; i <= n; ++i)
fin >> v[i];
for(int i = 1; i <= k; ++i){
while(!dq.empty() && dq.back().first >= v[i])
dq.pop_back();
dq.push_back({v[i], i});
}
int st = 1, dr = k, val = dq.front().first;
for(int i = k + 1; i <= n; ++i){
if(!dq.empty() && dq.front().second == i - k)
dq.pop_front();
while(!dq.empty() && dq.back().first >= v[i])
dq.pop_back();
dq.push_back({v[i], i});
if(dq.front().first > val){
val = dq.front().first;
dr = i;
st = i - k + 1;
}
}
fout << st << ' ' << dr << ' ' << val << '\n';
return 0;
}