Pagini recente » Cod sursa (job #1924635) | Cod sursa (job #788521) | Cod sursa (job #2035605) | Cod sursa (job #87405) | Cod sursa (job #460035)
Cod sursa(job #460035)
#include<cstdio>
#include<fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int sol = -999999,n,k,i,front,back,v[500005],deque[500005],a,b;
int main () {
fin>>n>>k;
for(i=1; i<=n ;++i)
fin>>v[i];
front = 1; back = 1;
deque[1] = 1;
a = b = 1;
for(i=2; i<=n; ++i){
while(front<=back && v[i]<=v[deque[back]])
back--;
deque[++back] = i;
if(i>=k&&v[deque[front]]>sol){
a = i-k+1; b = i;
sol = v[deque[front]];
}
if(deque[front]<=i-k+1)
front++;
}
fout<<a<<" "<<b<<" "<<sol;
return 0;
}