Pagini recente » Cod sursa (job #2186367) | Cod sursa (job #1595591) | Cod sursa (job #1341878) | Cod sursa (job #103728) | Cod sursa (job #2980468)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n, k, x[500005], poz_start, poz_final, maxim;
int main()
{
fin >> n >> k;
for(int i=1;i<=n;i++)
fin >> x[i];
for(int i=1;i<=n-k+1;i++)
{
int minim = 30005;
for(int j=i;j<=i+k-1;j++)
if(x[i] < minim)
minim = x[i];
if(minim > maxim)
{
maxim = minim;
poz_start = i;
poz_final = i+k-1;
}
}
fout << poz_start << " " << poz_final << " " << maxim;
return 0;
}