Pagini recente » Cod sursa (job #3168246) | Cod sursa (job #3273218) | Cod sursa (job #750101) | Cod sursa (job #2276926) | Cod sursa (job #2472515)
//
// main.cpp
// Secventa
//
// Created by Darius Buhai on 12/10/2019.
// Copyright © 2019 Darius Buhai. All rights reserved.
//
#include <iostream>
#include <fstream>
#define MAXL 500005
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int main() {
int n, k, a, b[MAXL], c[MAXL];
int maxi = -30005, ps, pe;
fin>>n>>k;
for(int i=0;i<n;i++){
fin>>a;
c[0] = a;
for(int j=1;j<min(i+1, k);j++){
c[j] = min(b[j-1], a);
if(j==k-1 && c[j]>maxi){
maxi = c[j];
pe = i+1;
}
}
for(int j=0;j<k;j++)
b[j] = c[j];
}
fout<<pe-k+1<<' '<<pe<<' '<<maxi;
return 0;
}