Pagini recente » Cod sursa (job #1355382) | Cod sursa (job #2876414) | Cod sursa (job #1530678) | Cod sursa (job #627158) | Cod sursa (job #1872428)
#include <fstream>
#include <iostream>
#include <string.h>
#include <deque>
#define NM 500005
#define inf 0x3f3f3f3f
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n, v[NM],k;
char s[NM * 3];
deque < int > dq;
int main()
{
int sol = -inf, st, dr, l, sign = 1, nr = 0, m = 0;
f >> n >> k;
f.getline(s,0);
f.getline(s,NM * 3);
l = strlen(s);
for(int i = 0; i < l; )
{
while(s[i] >= '0' && s[i] <= '9') nr = 10 * nr + (s[i] - '0'), i++;
if(s[i] == ' ') v[++m] = sign * nr, sign = 1, nr = 0, i++;
else if(s[i] == '-') sign = -1, i++;
}
v[++m] = nr;
for(int i = 1; i <= n; ++i)
{
if(!dq.empty() && dq.front() <= i - k) dq.pop_front();
while(!dq.empty() && v[i] <= v[dq.back()]) dq.pop_back();
dq.push_back(i);
if(v[dq.front()] > sol && i >= k)
{
sol = v[dq.front()];
st = i - k + 1;
dr = i;
}
}
g << st << ' ' << dr << ' ' << sol;
}