Pagini recente » Cod sursa (job #1311333) | Cod sursa (job #64383) | Cod sursa (job #381355) | Cod sursa (job #1888741) | Cod sursa (job #2542365)
#include <fstream>
#include <iostream>
#include <deque>
#define x first
#define y second
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n,k,i,j,x,st,dr,m,semn,l;
deque <pair<short,int> > d;
char s[3000000];
void nr(){
if(s[l]=='-')
semn=-1,l++;
else
semn=1;
x=0;
while(s[l]>='0' && s[l]<='9')
x=x*10+s[l]-'0',l++;
l++;
x*=semn;
}
int main(){
fin>>n>>k;
fin.get();
fin.getline(s,3000000);
for(i=1;i<=k;i++){
// fin>>x;
nr();
while(!d.empty() && d.back().x > x)
d.pop_back();
d.push_back(make_pair(x,i));
}
st=1;
dr=k;
m=d.front().x;
for(;i<=n;i++){
// fin>>x;
nr();
while(!d.empty() && d.back().x > x)
d.pop_back();
d.push_back(make_pair(x,i));
if(i-d.front().y>=k)
d.pop_front();
if(d.front().x>m){
m=d.front().x;
dr=i;
st=i-k+1;
}
}
fout<<st<<" "<<dr<<" "<<m;
return 0;
}