Pagini recente » Cod sursa (job #297296) | Cod sursa (job #1010612) | Cod sursa (job #2555361) | Cod sursa (job #26203) | Cod sursa (job #2749218)
//#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream cin("secventa.in");
ofstream cout("secventa.out");
int deq[500005],sta,dre;
int v[500005];
inline void scoate(int poz){
if(sta<=dre){
if(deq[sta]==poz){
sta++;
}
}
}
inline void baga(int poz){
if(sta>dre){
deq[++dre]=poz;
}
while(sta<=dre){
if(v[deq[dre]]>v[poz]){
dre--;
}
else
break;
}
deq[++dre]=poz;
return;/*
if(dq.empty()==true){
dq.push_front(poz);
return;
}
while(dq.empty()==false){
if(v[dq.front()]>v[poz]){
dq.pop_front();
}
else
break;
}
dq.push_front(poz);
*/
}
inline int que(){
return deq[sta];
//return dq.back();
}
int main()
{
ios_base::sync_with_stdio(false);
int n,m,rasp=-31000;
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>v[i];
}
for(int i=1;i<=m;i++){
baga(i);
//cout<<1<<" "<<i<<" "<<v[que()]<<"\n";
}
int st,dr;
rasp=v[que()];
st=1;
dr=m;
for(int i=m+1;i<=n;i++){
scoate(i-m);
baga(i);
//cout<<i-m+1<<" "<<i<<" "<<v[que()]<<"\n";
int a=que();
if(rasp<v[a]){
st=i-m+1;
dr=i;
rasp=v[a];
}
}
cout<<st<<" "<<dr<<" "<<rasp;
return 0;
}