Pagini recente » Cod sursa (job #2202816) | Cod sursa (job #914644) | Cod sursa (job #1732610) | Borderou de evaluare (job #1777237) | Cod sursa (job #1713541)
#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
const int maxn = 500005;
deque <int> dq;
int v[maxn];
string s;
int n;
void citire()
{
getline(in, s);
getline(in, s);
int p = s.size();
int nr = 0;
int poz = 0;
int semn = 1;
for(int i = 0; i < p; i++)
{
if(s[i] >= '0' && s[i] <= '9')
nr = nr * 10 + semn * (s[i] - '0');
if(s[i] == ' ')
{
if(s[i+1] >= '0' && s[i+1] <= '9')
semn = 1;
v[++poz] = nr;
nr = 0;
}
if(s[i] == '-')
semn = -1;
}
v[++poz] = nr;
}
int main()
{
int k;
in >> n >> k;
citire();
int mx = -(1 << 30);
int poz = 0;
for(int i = 1; i <= n; i++)
{
while(!dq.empty() && v[dq.back()] > v[i])
dq.pop_back();
dq.push_back(i);
//while(!dq.empty() && v[dq.back()] >= v[i])
// dq.pop_back();
if(!dq.empty() && dq.front() <= i - k)
dq.pop_front();
if(mx < v[dq.front()] && k <= i)
{
mx = v[dq.front()];
poz = i - k + 1;
}
}
out << poz << " " << poz + k - 1 << " " << mx << "\n";
return 0;
}