Pagini recente » Cod sursa (job #841078) | Cod sursa (job #2803819) | Cod sursa (job #3144249) | Cod sursa (job #714132) | Cod sursa (job #928496)
Cod sursa(job #928496)
#include <fstream>
#define MAX 40000
using namespace std;
ifstream is ("secventa.in");
ofstream os ("secventa.out");
int n, k;
int a[500000];
int baza[500000];
int bmax;
int main()
{
is >> n >> k;
for (int i = 0; i < n; i++)
{
is >> a[i];
}
for (int i = 0; i < n-k+1; i++)
{
baza[i] = MAX;
for (int j = i; j < k+i; j++)
if (a[j] < baza[i])
baza[i] = a[j], bmax = a[j];
}
for (int i = 0; i <n-k+1; i++)
if (baza[i] == bmax)
{
os <<i+1 << " " << i+k << " " <<baza[i];
break;
}
is.close();
os.close();
return 0;
}