Pagini recente » Cod sursa (job #1923625) | Cod sursa (job #7469) | Cod sursa (job #2563768) | Cod sursa (job #736034) | Cod sursa (job #1602094)
#include <cstdio>
#include <deque>
#define NMAX 5001
using namespace std;
int main()
{
int n, k, v[NMAX], i, baza, start, end, max = - (1<<30);
deque<int> dq;
FILE *f = fopen("secventa.in", "r");
fscanf(f, "%d %d", &n, &k);
for (i = 1; i <= n; i++)
{
fscanf(f, "%d", &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;
}