Pagini recente » Cod sursa (job #3264155) | Cod sursa (job #1197202) | Cod sursa (job #388243) | Cod sursa (job #400536) | Cod sursa (job #3193458)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n, k, a[500005], maxim, solmaxim, st, dr;
int main()
{
int i, x;
fin >> n >> k;
for (i = 1; i <= n; i++)
fin >> a[i];
for (st = 1, dr = k; dr <= n; dr++, st++)
{
maxim = 1e9;
for (i = st; i <= dr; i++)
if (a[i] < maxim)maxim = a[i];
if (maxim > solmaxim)
{
solmaxim = maxim;
x = st;
}
}
fout << x << " " << x + k - 1 << " " << solmaxim;
return 0;
}