Pagini recente » Cod sursa (job #220066) | Cod sursa (job #2332631) | Cod sursa (job #2494963) | Cod sursa (job #2223307) | Cod sursa (job #2752334)
#include <fstream>
#include <climits>
using namespace std;
ifstream cin("secventa.in");
ofstream cout("secventa.out");
//Complexitate O(n * k)
int n, k , v[500001], sol[500001];
int st, dr, min_total = INT_MIN;
int main()
{
cin >> n >> k ;
for(int i = 1; i <= n; i++)
cin >> v[i];
for(int i = 1; i <= n - k + 1; i++)
{
int mini = INT_MAX;
for(int j = i; j <= i + k - 1; j++)
if(v[j] < mini)
mini = v[j];
sol[i] = mini;
if(sol[i] > min_total)
{
min_total = sol[i];
st = i;
dr = i + k - 1;
}
}
//sol[] 1 -> n-k pozitii
cout << st << " " << dr << " " << min_total;
return 0;
}