Pagini recente » Cod sursa (job #1728202) | Cod sursa (job #531873) | Cod sursa (job #829575) | Cod sursa (job #1068836) | Cod sursa (job #2470743)
#include <bits/stdc++.h>
using namespace std;
int v[500001];
int main()
{
ios_base::sync_with_stdio(false);
ifstream fin("secventa.in");
ofstream fout("secventa.out");
deque<int> dq;
int n, k, first, last, mmin{-100000};
fin >> n >> k;
for(int i = 1; i <= n; ++i) fin >> v[i];
for(int i = 1; i <=n; ++i){
while(!dq.empty() && v[dq.back()] >= v[i]) dq.pop_back();
dq.push_back(i);
if(dq.front() == i - k) dq.pop_front();
if(i >= k && v[dq.front()] > mmin){
mmin = v[dq.front()];
last = i;
first = i - k + 1;
}
}
fout<<first<<" "<<last<<" "<<mmin;
}