Pagini recente » Cod sursa (job #2067604) | Cod sursa (job #3197142) | Cod sursa (job #1991225) | Cod sursa (job #2295352) | Cod sursa (job #2044452)
#include <fstream>
#include <deque>
#define NMAX 500010
#define INF 1000000
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n, k, stmin = INF, bmax = -INF, v[NMAX];
deque<int> d;
void insereaza(int x);
void sterge(int i);
int main()
{
int i;
fin >> n >> k;
for (i = 1; i <= k; i++)
{
fin >> v[i];
insereaza(i);
}
if (v[d.front()] > bmax)
{
bmax = v[d.front()];
stmin = 1;
}
for (i = k + 1; i <= n; i++)
{
fin >> v[i];
sterge(i);
insereaza(i);
if (v[d.front()] > bmax)
{
bmax = v[d.front()];
stmin = i - k + 1;
}
}
fout << stmin << ' ' << stmin + k - 1 << ' ' << bmax << '\n';
fout.close();
return 0;
}
void insereaza(int x)
{
while (!d.empty() && v[x] < v[d.back()])
d.pop_back();
d.push_back(x);
}
void sterge(int i)
{
if (d.front() <= i - k)
d.pop_front();
}