Pagini recente » Cod sursa (job #233627) | Cod sursa (job #98866) | Cod sursa (job #1528735) | Cod sursa (job #2070824) | Cod sursa (job #1274620)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
const int NMax = 500010;
int v[NMax],deq[NMax];
int main()
{
int N,K,fata,spate,pz,bmn = -NMax,mn = -NMax;
f >> N >> K;
for(int i = 1; i <= N; i++)
f >> v[i];
fata = 1;
spate = 0;
for(int i = 1; i <= N; i++){
while(fata <= spate && v[i] <= v[deq[spate]])
spate--;
deq[++spate] = i;
if(deq[fata] == i-K)
fata++;
if(i >= K && v[deq[fata]] > bmn){
bmn = v[deq[fata]];
pz = i;
}
}
g << pz - K + 1 << " " << pz << " " << bmn;
return 0;
}