Pagini recente » Cod sursa (job #1634615) | Cod sursa (job #190142) | Cod sursa (job #1429457) | Cod sursa (job #752223) | Cod sursa (job #2413902)
#include <fstream>
#include <deque>
#define NM 500003
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int i,n,k,fr,bk,max1,in,sf,j,st,dr;
int a[NM],dq[NM];
int main()
{
f>>n>>k;
for(i=1;i<=n;i++) f>>a[i];
max1=-30003;
st=1; dr=0;
for(i=1;i<=n;i++){
while(st<=dr&&a[i]<=a[dq[dr]]) dr--;
dq[++dr]=i;
if(i-k==dq[st]) st++;
if(i>=k&&max1<a[dq[st]]){
max1=a[dq[st]];
in=i-k+1;
sf=i;
}
}
g<<in<<' '<<sf<<' '<<max1<<'\n';
return 0;
}