Pagini recente » Cod sursa (job #3182451) | Istoria paginii runda/tema_pentru_vacanta | Cod sursa (job #2825267) | Cod sursa (job #1965644) | Cod sursa (job #535776)
Cod sursa(job #535776)
# include <cstdio>
# include <cstdlib>
using namespace std;
int n, k, i, front, back, sum, pozi, pozf, max, a[100000], deque[100000];
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 = deque[front];
pozf = deque[back];
}
}
printf("%d %d %d",pozi,pozf,max);
return 0;
}