Pagini recente » Cod sursa (job #1351942) | Cod sursa (job #2282152) | Cod sursa (job #2986285) | Cod sursa (job #2039279) | Cod sursa (job #2337374)
#include <fstream>
#include <deque>
#define NM 500006
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,k,fr,bk,i,max1,pi,pj;
int d[NM],a[NM];
int main()
{
f>>n>>k; max1=0-NM;
fr=1; bk=0;
for(i=1;i<=n;i++){
f>>a[i];
while(fr<=bk&&a[d[bk]]>=a[i]) bk--;
d[++bk]=i;
if(i-k==d[fr]) fr++;
if(i>=k&&max1<=a[d[fr]]){
pi=i-k+1; pj=i;
max1=a[d[fr]];
}
}
g<<pi<<' '<<pj<<' '<<max1;
return 0;
}