Pagini recente » Cod sursa (job #2460125) | Cod sursa (job #3269360) | Cod sursa (job #2478177) | Cod sursa (job #2915486) | Cod sursa (job #535798)
Cod sursa(job #535798)
# include <cstdio>
# include <cstdlib>
using namespace std;
int n, k, i, front, back, sum, pozi, pozf, max, a[500005], deque[500005];
int main()
{
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; max = -100;
for (i = 1; i <= n; i++)
{
while (front <= back && a[i] <= a[deque[back]]) back--;
deque[++back] = i;
if (deque[front] == i - k) front++;
if (i >= k && max < a[deque[front]])
{
max = a[deque[front]];
pozi = i - k + 1;
pozf = pozi + k - 1;
}
}
printf("%d %d %d",pozi,pozf,max);
return 0;
}