Pagini recente » Cod sursa (job #1145592) | Cod sursa (job #749252) | Cod sursa (job #2875502) | Cod sursa (job #694522) | Cod sursa (job #1872221)
#include <fstream>
#include <iostream>
#include <deque>
#define inf 0x3f3f3f3f
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n, v[500005],k;
deque < int > dq;
int main()
{
int sol = -inf, st, dr;
f >> n >> k;
for(int i = 1; i <= n; ++i) f >> v[i];
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 = dq.front();
dr = i;
}
}
g << st << ' ' << dr << ' ' << sol;
}