Pagini recente » Cod sursa (job #1034493) | Cod sursa (job #2289397) | Diferente pentru utilizator/mocke intre reviziile 21 si 15 | Cod sursa (job #63857) | Cod sursa (job #471806)
Cod sursa(job #471806)
# include <stdlib.h>
# include <cstdio>
using namespace std;
int n, k, front, back, a[500005], deque[500005], max, pozmax;
int main()
{int i;
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
scanf("%d%d",&n,&k);
for (i = 1; i <= n; i++)
scanf("%d",&a[i]);
front = 1; back = 0;
for (i = 1; i <= n; i++)
{
while (front <= back && a[i] < a[deque[back]]) back --;
deque[++back] = i;
if (deque[front] == i - k) front ++;
max = -1000; pozmax = -1000;
if (front > pozmax) {
pozmax = deque[front];
max = a[deque[front]];
}
}
printf("%d %d %d", max, pozmax, pozmax + k - 1);
return 0;
}