Pagini recente » Clasament budescu | Cod sursa (job #589254) | Cod sursa (job #1725320) | Cod sursa (job #2366159) | Cod sursa (job #1481419)
#include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n, k, m, cc;
int a[500010];
int deque[500010];
int main(){
fin>>n>>k;
for(int i=1;i<=n;++i) fin>>a[i];
int back=0;
int front=1;
int mx=-30001;
for(int i=1;i<=n;++i){
while(front<=back && a[i]<=a[deque[back]]) back--;
deque[++back]=i;
if(deque[front]==i-k) ++front;
if(i>=k){
m=a[deque[front]];
if(m>mx){
cc=i-k+1;
mx=m;
}
}
}
fout<<cc<<' '<<cc+k-1<<' '<<mx;
return 0;
}