Pagini recente » Cod sursa (job #1173238) | Cod sursa (job #435026) | Cod sursa (job #2105933) | Cod sursa (job #1709715) | Cod sursa (job #1947940)
#include <iostream>
#include <deque>
#include <fstream>
#define MIN -30001
using namespace std;
ifstream f ("secventa.in");
ofstream g ("secventa.out");
short v[500005];
int N, k, a, b, best = MIN, t = 0;
deque < int > deq;
string s;
int main()
{
f >> N >> k;
f.get();
getline(f, s);
short semn = 1;
int x;
for(int i = 0; i < s.size(); ++i)
{
if(s[i] == '-') semn = -1;
if(isdigit(s[i]))
{
x = 0;
while(isdigit(s[i]))
{
x = x * 10 + s[i] - '0';
++i;
}
x *= semn;
v[++t] = x;
x = 0;
semn = 1;
}
}
for(int i = 1; i <= N; ++i)
{
while(!deq.empty() && v[i] <= v[deq.back()])
deq.pop_back();
deq.push_back(i);
if(deq.front() == i - k) deq.pop_front();
if(i >= k && best < v[deq.front()]) {
best = v[deq.front()];
a = i - k + 1; b = i;}
}
g << a << " " << b << " " << best;
}