Pagini recente » Cod sursa (job #2160176) | Cod sursa (job #1740382) | Cod sursa (job #3309313) | Diferente pentru problema/dubi intre reviziile 34 si 33 | Cod sursa (job #2472549)
//
// main.cpp
// Secventa
//
// Created by Darius Buhai on 12/10/2019.
// Copyright © 2019 Darius Buhai. All rights reserved.
//
#include <iostream>
#include <cstdio>
#include <deque>
#define MAXL 500005
using namespace std;
int main() {
freopen("secventa.in", "r", stdin);
freopen("secventa.out", "w", stdout);
deque<int> a1, a2;
int n, k, a, i, j;
int maxi = -30005, ps = 0, pe = 0;
cin>>n>>k;
for(i=0;i<n;i++){
cin>>a;
a1.push_back(a);
for(j=1;j<min(i+1, k);j++){
int x = min(a2.front(), a);
a1.push_back(x);
a2.pop_front();
if(j==k-1 && x>maxi){
maxi = x;
pe = i+1;
}
}
a2 = a1;
a1.clear();
}
cout<<pe-k+1<<' '<<pe<<' '<<maxi;
return 0;
}