Pagini recente » Cod sursa (job #2736504) | Cod sursa (job #2269665) | Cod sursa (job #441817) | Cod sursa (job #1015482) | Cod sursa (job #2472534)
//
// main.cpp
// Secventa
//
// Created by Darius Buhai on 12/10/2019.
// Copyright © 2019 Darius Buhai. All rights reserved.
//
#include <iostream>
#include <cstdio>
#define MAXL 500005
using namespace std;
int main() {
freopen("secventa.in", "r", stdin);
freopen("secventa.out", "w", stdout);
int n, k, a, b[MAXL], i, j;
int maxi = -30005, ps = 0, pe = 0, aux1, aux2;
cin>>n>>k;
for(i=0;i<n;i++){
cin>>a;
aux2 = b[0];
b[0] = a;
for(j=1;j<min(i+1, k);j++){
aux1 = b[j];
b[j] = min(aux2, a);
aux2 = aux1;
if(j==k-1 && b[j]>maxi){
maxi = b[j];
pe = i+1;
}
}
}
printf("%d %d %d", pe-k+1, pe, maxi);
return 0;
}