Pagini recente » Cod sursa (job #2946641) | Cod sursa (job #1615424) | Cod sursa (job #2627535) | Cod sursa (job #960433) | Cod sursa (job #809759)
Cod sursa(job #809759)
#include <cstdio>
#define maxN 500005
FILE *f = fopen ("secventa.in","r");
FILE *g = fopen ("secventa.out","w");
int n, k, a[maxN], deque[maxN], begin, end, rez = -(1 << 30);
void read()
{
fscanf (f, "%d%d", &n, &k);
for (int i = 1; i <= n; i++)
fscanf (f, "%d", &a[i]);
}
void solve()
{
int front = 1, back = 0;
for (int 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) {
if (a[deque[front]] > rez) {
rez = a[deque[front]];
begin = i - k + 1;
end = i;
}
}
}
}
int main()
{
read();
solve();
fprintf (g, "%d %d %d\n", begin, end, rez);
fclose(f);
fclose(g);
return 0;
}