Pagini recente » Cod sursa (job #521787) | Cod sursa (job #865985) | Cod sursa (job #777595) | Cod sursa (job #867545) | Cod sursa (job #2369050)
/*
* @source 'https://infoarena.ro/problema/secventa'
*/
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secventa.in");
ofstream fout ("secventa.out");
int n, k;
int tab[100];
int baza(int start, int stop)
{
int minim = 999999;
for(int i = start; i <= stop; i++)
{
if (minim < tab[i])
{
minim = tab[i];
}
}
}
int main()
{
int maxim;
int maxim_begin;
int maxim_end;
int current;
vector<int> vec;
int aux;
fin >> n >> k;
for(int i = 0; i < n; i++)
{
fin >> aux;
tab[i] = aux;
// vec.push_back(aux);
}
maxim = -999999;
maxim_begin = -1;
maxim_end = -1;
current = 0;
for(int i = 0; i < n - k + 1; i++)
{
// current = min_element(vec.begin() + i, vec.begin() + i + k - 1);
current = *min_element(tab + i, tab + i + k - 1);
// cout << " CUR : " << current << " | " << i << " : " << i + k - 1 << "\n";
if (maxim < current)
{
maxim = current;
maxim_begin = i;
maxim_end = i + k - 1;
}
// cout << " -> " << maxim << " | " << i << "\n";
}
fout << maxim_begin + 1 << " " << maxim_end + 1 << " " << maxim;
return 0;
}