Pagini recente » Cod sursa (job #2048113) | Cod sursa (job #1618227) | Cod sursa (job #881083) | Cod sursa (job #1410898) | Cod sursa (job #2327663)
#include <bits/stdc++.h>
using namespace std;
class InParser
{
private:
FILE *fin;
char *buff;
int sp;
char read_ch()
{
sp++;
if(sp == 4096)
{
sp = 0;
fread(buff, 1, 4096, fin);
}
return buff[sp];
}
public:
InParser(const char* nume)
{
fin = fopen(nume, "r");
buff = new char[4096]();
sp = 4095;
}
InParser& operator >> (int &n)
{
char c;
while(!isdigit(c = read_ch()) && c != '-');
int sgn = 1;
if(c == '-')
{
n = 0;
sgn = -1;
}
else
n = c - '0';
while(isdigit(c = read_ch()))
n = 10 * n + c - '0';
n *= sgn;
return *this;
}
};
InParser in("secventa.in");
ofstream out("secventa.out");
const int N = 5e5+1;
int v[N];
deque<int> q;
int main()
{
int n,k;
in >> n >> k;
for (int i = 1; i<=n; i++)
in >> v[i];
int Max = -1e9, dr = k;
for (int i = 1; i<=n; i++)
{
while (!q.empty() && v[q.back()]>=v[i])
q.pop_back();
q.push_back(i);
if (i-q.front() == k)
q.pop_front();
if (i>=k && v[q.front()]>Max)
{
Max = v[q.front()];
dr = i;
}
}
out << dr-k+1 << " " << dr << " " << Max;
}