Pagini recente » Cod sursa (job #449464) | Cod sursa (job #2215750) | Cod sursa (job #1156069) | Cod sursa (job #153598) | Cod sursa (job #2487261)
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
ifstream fin{"secventa.in"};
ofstream fout("secventa.out");
int N, K, st, dr, baza_max;
deque<pair<int, int>> dq;
fin >> N >> K;
baza_max = - 1000000000;
for(int i = 1; i <= N; ++i)
{
int x;
fin >> x;
while(dq.empty() == false && dq.back().first >= x)
{
dq.pop_back();
}
dq.push_back({x, i});
if(i >= K)
{
if(dq.front().first > baza_max)
{
baza_max = dq.front().first;
dr = i;
}
if(dq.front().second + K - 1 == i)
{
dq.pop_front();
}
}
}
st = dr - K + 1;
fout << st << " " << dr << " " << baza_max;
}