Pagini recente » Cod sursa (job #755446) | Cod sursa (job #2527832) | Cod sursa (job #2028641) | Cod sursa (job #1205906) | Cod sursa (job #2439544)
#include <fstream>
#include <deque>
#define val first
#define poz second
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n,i,k,x,mx=-2000000000,i1,i2;
deque <pair<int,int> > deq;
int main(){
fin>>n>>k;
for(i=1;i<=n;i++){
fin>>x;
while(deq.size() && x<=deq.back().val)
deq.pop_back();
deq.push_back({x,i});
if(deq.front().poz==i-k)
deq.pop_front();
if(i>=k && deq.front().val>mx){
mx=deq.front().val;
i1=i-k+1;
i2=i;
}
}
fout<<i1<<" "<<i2<<" "<<mx;
return 0;
}