Pagini recente » Cod sursa (job #1846547) | Cod sursa (job #3179146) | Cod sursa (job #817978) | Cod sursa (job #298015) | Cod sursa (job #2725711)
#include <bits/stdc++.h>
using namespace std;
const int INF = (int)2e9;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
freopen("secventa.in", "r", stdin);
freopen("secventa.out", "w", stdout);
deque<int> d;
int n, k;
cin >> n >> k;
int a[n+1];
for(int i=1;i<=n;i++)
cin >> a[i];
int ans = -INF, st=1;
for(int i=1;i<=k;i++) {
while(!d.empty() && a[i]<=a[d.back()])
d.pop_back();
d.push_back(i);
}
ans = a[d.front()];
for(int i=k+1;i<=n;i++) {
if(d.front() == i-k)
d.pop_front();
while(!d.empty() && a[i]<=a[d.back()])
d.pop_back();
d.push_back(i);
if(ans<a[d.front()]) {
ans = a[d.front()];
st = i-k+1;
}
}
cout << st << ' ' << st+k-1 << ' ' << ans;
return 0;
}