Pagini recente » Cod sursa (job #506688) | Cod sursa (job #1538724) | Cod sursa (job #1327695) | Cod sursa (job #1873126) | Cod sursa (job #2439536)
#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=-30001,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(i-deq.front().poz==k)
deq.pop_front();
if(i>=k && deq.front().val>mx){
mx=deq.front().val;
i1=deq.front().poz;
}
}
fout<<i1<<" "<<i1+k-1<<" "<<mx;
return 0;
}