Pagini recente » Cod sursa (job #46281) | Cod sursa (job #105088) | Cod sursa (job #1568542) | Cod sursa (job #2059185) | Cod sursa (job #1208203)
#include <fstream>
#include <deque>
using namespace std;
struct P{int x,y;};
deque<P> D;
int main(){
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,k,x,I,J;
int Val=-30001;
f >> n >> k;
for(int i=1;i<=n;i++){
f >> x;
while(!D.empty() && x<D.back().x) D.pop_back();
P a;
a.x=x;
a.y=i;
D.push_back(a);
if(i-D.front().y+1>k) D.pop_front();
if(i>=k && D.front().x>Val){
Val=D.front().x;
J=i;
I=i-k+1;
}
}
g << I << " " << J << " " << Val << "\n";
}