Pagini recente » Cod sursa (job #155894) | Cod sursa (job #1184993) | Cod sursa (job #2476284) | Cod sursa (job #450984) | Cod sursa (job #1602117)
#include <cstdio>
#include <deque>
#include <string>
#include <fstream>
#include <sstream>
#define NMAX 500001
using namespace std;
int main()
{
int n, k, v[NMAX], i, baza, end, max = - (1<<30);
deque<int> dq;
ifstream fin("secventa.in");
stringstream bfr;
bfr << fin.rdbuf();
bfr >> n >> k;
for (i = 1; i <= n; i++)
{
bfr >> v[i];
}
dq.push_back(1);
for (i = 2; i <= n; i++)
{
while (!dq.empty() && dq.front() < i - k + 1)
{
dq.pop_front();
}
while (!dq.empty() && v[dq.back()] > v[i])
{
dq.pop_back();
}
dq.push_back(i);
if (i >= k)
{
baza = dq.front();
if (v[baza] > max)
{
max = v[baza];
end = i;
}
}
}
FILE *g = fopen("secventa.out", "r");
fprintf(g, "%d %d %d", end - k + 1, end, max);
return 0;
}