Pagini recente » Cod sursa (job #1342969) | Cod sursa (job #671466) | Cod sursa (job #2845444) | Cod sursa (job #1490564) | Cod sursa (job #2999640)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n, a[500001], q[500001], k, mx = -30001, pi = 0, pj = 0;
int uq = -1, pq = 0;
int main()
{
fin >> n >> k;
for (int i = 1; i <= n; i++)
{
fin >> a[i];
}
for (int i = 1; i <= n; i++)
{
while (pq <= uq && a[i] <= a[q[uq]])
{
uq--;
}
q[++uq] = i;
if (q[pq] <= i - k)pq++;
if (i>=k && a[q[pq]] > mx)
{
mx = a[q[pq]];
pj = i;
}
}
fout << pj-k+1<<" " << pj<<" " << mx;
}