Pagini recente » Cod sursa (job #1645688) | Cod sursa (job #331614) | Cod sursa (job #2037306) | Istoria paginii runda/kontrollarbeit1 | Cod sursa (job #2010606)
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <ctime>
#include <deque>
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define pb push_back
const int NMax = 5e5 + 5;
const int strMax = 6*NMax + 50;
const short inf = 31e3 + 5;
int N,K;
char str[strMax],*p = str;
short v[NMax];
deque<int> deq;
short getNumber();
int main() {
in.get(str,strMax,'&');
//in>>N>>K;
N = getNumber();
K = getNumber();
for (int i=1;i < K;++i) {
//in>>v[i];
v[i] = getNumber();
while (deq.size() && v[deq.back()] >= v[i]) {
deq.pop_back();
}
deq.push_back(i);
}
short mx = -inf;
int st = -1,dr = -1;
for (int i=K;i <= N;++i) {
//in>>v[i];
v[i] = getNumber();
if (deq.front() == i-K) {
deq.pop_front();
}
while (deq.size() && v[deq.back()] >= v[i]) {
deq.pop_back();
}
deq.push_back(i);
if (v[deq.front()] > mx) {
mx = v[deq.front()];
st = i-K+1;
dr = i;
}
}
out<<st<<' '<<dr<<' '<<mx<<'\n';
return 0;
}
short getNumber() {
bool neg = false;
while (!('0' <= *p && *p <= '9')) {
if (*p == '-') {
neg = true;
}
++p;
}
short ans = 0;
while ('0' <= *p && *p <= '9') {
ans = ans * 10 + *p++ - '0';
}
return (neg) ? -ans : ans;
}