Pagini recente » Cod sursa (job #2480444) | Cod sursa (job #735722) | Cod sursa (job #602713) | Cod sursa (job #56583) | Cod sursa (job #2356804)
#include <bits/stdc++.h>
using namespace std;
class InputReader
{
public:
static const int BUFF_SIZE = 1 << 17;
FILE *fin;
int bp;
char buff[BUFF_SIZE];
InputReader (const char *file_name)
{
fin = fopen(file_name, "r");
bp = BUFF_SIZE - 1;
}
void adv()
{
if (++bp == BUFF_SIZE)
{
fread(buff, sizeof(char), BUFF_SIZE, fin);
bp = 0;
}
}
InputReader& operator >> (int& num)
{
num = 0;
int semn = 1;
while (isdigit(buff[bp]) == false)
{
if (buff[bp] == '-')
semn = -1;
adv();
}
while (isdigit(buff[bp]))
{
num = num * 10 + buff[bp] - '0';
adv();
}
num *= semn;
return *this;
}
};
InputReader fin("secventa.in");
ofstream fout("secventa.out");
int v[500005];
int deq[500005];
int main()
{
int n, k, maxim = INT_MIN, i, st, dr, Front = 1, Back = 0;
fin >> n >> k;
for (i = 1; i <= n; ++i)
{
fin >> v[i];
}
for (i = 1; i <= n; ++i)
{
while (Front <= Back && v[i] <= v[deq[Back]])
--Back;
deq[++Back] = i;
if (deq[Front] == i - k)
++Front;
if (i >= k)
{
if (v[deq[Front]] > maxim)
{
maxim = v[deq[Front]], st = i - k + 1, dr = i;
}
}
}
fout << st << ' ' << dr << ' ' << maxim << '\n';
return 0;
}