Pagini recente » Cod sursa (job #1329778) | Cod sursa (job #1378508) | Cod sursa (job #1479659) | Cod sursa (job #2138197) | Cod sursa (job #2304560)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
const int N=5000000;
int dq[N];
long long v[N];
int main()
{
int n, k, st=0, dr=-1, ist, idr, min=-1;
in>>n>>k;
for(int i=0; i<n; i++){
in>>v[i];
}
for(int i=0; i<n; i++){
if(st<=dr && dq[st]==i-k){
st++;
}
while(st<=dr && v[i]<=v[dq[dr]]){
dr--;
}
dq[++dr]=i;
if(v[dq[st]]>min)
{
min=v[dq[st]];
ist=i-k+1;
idr=i;
}
}
out<<ist+1<<" "<<idr+1<<" "<<min;
return 0;
}