Pagini recente » Cod sursa (job #2758487) | Cod sursa (job #144331) | Cod sursa (job #1197390) | Cod sursa (job #2846652) | Cod sursa (job #2046139)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
const int N=5000001;
int v[N],d[N];
long long s;
int n,k,st,dr=-1,bmax=-30001,bs,bd;
int main()
{
f>>n>>k;
for(int i=0;i<n;i++){
f>>v[i];
if(st<=dr && d[st]==i-k)
++st;
while(st<=dr && v[i]<=v[d[dr]])
--dr;
d[++dr]=i;
if(i>=k-1)
if(v[d[st]]>bmax){
bmax=v[d[st]];
bs=i+2-k;
bd=i+1;
}
}
g<<bs<<' '<<bd<<' '<<bmax;
return 0;
}