Pagini recente » Cod sursa (job #3209904) | Cod sursa (job #2441048) | Cod sursa (job #598488) | Cod sursa (job #2327346) | Cod sursa (job #3131669)
#include <fstream>
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
inline int Min(int a, int b)
{
int c = a < b? a : b;
return c;
}
int a[500001];
int main()
{
int N, K, i, j, max_base = -30001, base, dr;
in >> N >> K;
for (i = 1; i <= N; ++i)
in >> a[i];
in.close();
for (i = 1; i <= N - K + 1; ++i)
{
base = 30001;
for (j = i; j < i + K; ++j)
base = Min(base, a[j]);
if (base > max_base)
{
dr = i + K - 1;
max_base = base;
}
}
out << dr - K + 1 << ' ' << dr << ' ' << max_base << '\n';
out.close();
return 0;
}