Pagini recente » Cod sursa (job #242724) | Cod sursa (job #1464305) | Cod sursa (job #3182507) | Cod sursa (job #40672) | Cod sursa (job #1454594)
#include <iostream>
#include <fstream>
#include <assert.h>
const char IN[] = "secventa.in", OUT[] = "secventa.out";
const int NMAX = 500000;
const int INF = 0x3f3f3f3f;
using namespace std;
int K, N;
int V[NMAX];
int best[NMAX];
inline void read_data() {
assert(freopen(IN, "r", stdin));
assert(scanf("%d %d", &N, &K));
for (int i = 0; i < N; ++i)
assert(scanf("%d", &V[i]));
fclose(stdout);
}
inline void PD() {
int best_start = 0, best_end = K - 1;
for (int i = 1; i < N - K + 1; ++i)
if (V[i] > V[best_start]) best_start = i, best_end = i+K-1;
fprintf(fopen(OUT, "w"), "%d %d %d\n", best_start + 1, best_end + 1, V[best_start]);
}
int main() {
read_data();
PD();
return 0;
}