Pagini recente » Cod sursa (job #1548706) | Cod sursa (job #562834) | Cod sursa (job #590019) | Cod sursa (job #144708) | Cod sursa (job #1428754)
#include <stdio.h>
int deque[500000];
int v[500000];
int main()
{
freopen("secventa.in", "r", stdin);
freopen("secventa.out", "w", stdout);
int n, k;
scanf("%d %d", &n, &k);
scanf("%d", &v[0]);
int l = 0;
int r = 0;
deque[l] = 0;
int max = -30001;
int pozmin = 0;
for (int i = 1; i < n; i++)
{
scanf("%d", &v[i]);
while (r >= l && v[i] < v[deque[r]])
{
r--;
}
deque[++r] = i;
int val = deque[l];
if (v[val] > max && i >= k - 1)
{
max = v[val];
pozmin = val;
}
if (i - val == k - 1)
l++;
}
printf("%d %d %d\n", pozmin + 1, pozmin + k, max);
return 0;
}