Pagini recente » Cod sursa (job #1811110) | Cod sursa (job #2006986) | Cod sursa (job #2382471) | Cod sursa (job #2803528) | Cod sursa (job #2809432)
#include <bits/stdc++.h>
using namespace std;
ofstream fout ("secventa.out");
int const N = 5e5 + 3 , inf = (1 << 30) , S = 1e6;
int v[N] , p;
char buff[S];
void check (){
if (p == S){
fread(buff , 1 , S , stdin);
p = 0;
}
}
void get (int &x){
while(!isdigit(buff[p])){
++ p;
check();
}
x = 0;
while (isdigit(buff[p])){
x = x * 10 + (buff [p] - '0');
++ p;
check ();
}
}
int main(){
freopen("secventa.in" , "r" , stdin);
fread(buff , 1 , S , stdin);
int n , k;
get(n) , get(k);
for(int i = 1 ; i <= n ; ++ i)
get(v [i]);
deque <int> d;
int ans (-inf) , left , right;
for(int i = 1 ; i <= n ; ++ i){
while (d.size () && i - d.front () >= k)
d.pop_front ();
while (d.size () && v [d.back ()] > v [i])
d.pop_back ();
d.push_back (i);
if (d.size () && i >= k && v [d.front ()] > ans){
ans = v [d.front ()];
right = i;
}
}
fout << right - k + 1 << ' ' << right << ' ' << ans << '\n';
fout.close();
return 0;
}