Pagini recente » Cod sursa (job #274320) | Cod sursa (job #1665053) | Cod sursa (job #2565764) | Cod sursa (job #481344) | Cod sursa (job #1253384)
#include <fstream>
#include <deque>
#include <iostream>
using namespace std;
int numere[500000];
int main()
{
ifstream in("secventa.in");
ofstream out("secventa.out");
int n, i, k,curent,j,a,b,minim=90000;
in >> n;
in >> k;
for (i = 1; i <= n; i++)
{
in >> numere[i];
}
curent = 30001;
for (i = 1; i <= k; i++)
{
if (numere[i] < curent){ curent = numere[i]; }
}
minim = curent;
a = 1;
b = k;
for (i = 2; i <= n - k + 1; i++)
{
if (curent == numere[i - 1])
{
curent = 30001;
for (j = i; j <= i + k - 1; j++)
{
if (numere[j] < curent){ curent = numere[j]; }
}
if (curent>minim){ minim = curent; a = i; b = i + k - 1; }
}
}
out << a << " " << b << " " << minim << "\n";
}