Pagini recente » Cod sursa (job #2461730) | Cod sursa (job #2195941) | Cod sursa (job #2536242) | Cod sursa (job #977346) | Cod sursa (job #2223722)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int min(int a, int b, int v[5000])
{
int mn = v[a];
for (int i = a + 1; i <= b; i++)
if (v[i] < mn)
mn = v[i];
return mn;
}
int main()
{
int n, m, v[5000], start, mx;
f >> n>>m;
for (int i = 1; i <= n; i++)
f >> v[i];
start = 1;
mx = min(start, start + m - 1, v);
for (int i = 2; i <= n; i++)
{
if (i + m - 1 <= n)
{
int x;
x = min(i, i + m - 1, v);
if (x > mx)
{
mx = x;
start = i;
}
else
i = i + m - 1;
}
}
g << start << " " <<start+m-1<<" " << mx;
cin.get();
return 0;
}