Moon landing

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <climits>

using namespace std;

template<class T, class Op>
struct SegTree {
    int n;
    T ID;
    Op op;
    vector<T> st;

    SegTree(int n = 0, T ID = T(), Op op = Op()) { init(n, ID, op); }

    void init(int n_, T ID_, Op op_ = Op()) {
        n = n_;
        ID = ID_;
        op = op_;
        st.assign(2 * n, ID);
    }

    void build(const vector<T> &a) {
        n = (int) a.size();
        st.assign(2 * n, ID);
        for (int i = 0; i < n; i++) st[n + i] = a[i];
        for (int i = n - 1; i > 0; i--) st[i] = op(st[i << 1], st[i << 1 | 1]);
    }

    void set(int i, T v) {
        for (st[i += n] = v; i > 1; i >>= 1)
            st[i >> 1] = op(st[i], st[i ^ 1]);
    }

    T query(int l, int r) const {
        T resL = ID, resR = ID;
        for (l += n, r += n + 1; l < r; l >>= 1, r >>= 1) {
            if (l & 1) resL = op(resL, st[l++]);
            if (r & 1) resR = op(st[--r], resR);
        }
        return op(resL, resR);
    }
};

struct MinOp {
    long long operator()(long long a, long long b) const {
        return min(a, b);
    }
};
const long long MIN_ID = LLONG_MAX;

struct MaxOp {
    long long operator()(long long a, long long b) const {
        return max(a, b);
    }
};
const long long MAX_ID = LLONG_MIN;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    // freopen("input.txt", "r", stdin); // TODO: REMOVE THIS YOU STUPID ****

    int n, k;
    cin >> n >> k;
    vector<long long> origValues(n);
    for (int i = 0; i < n; i++) {
        cin >> origValues[i];
    }
    auto maxTree = SegTree(n, MAX_ID, MaxOp());
    auto minTree = SegTree(n, MIN_ID, MinOp());
    maxTree.build(origValues);
    minTree.build(origValues);

    int l = 0; int r = 0;
    int bestPos = 0;
    int bestLen = 0;

    while (l < n && r < n) {
        long long minHere = minTree.query(l, r);
        long long maxHere = maxTree.query(l, r);
        if (maxHere - minHere <= k) {
            r++;
            auto len = r - l;
            if (len > bestLen) {
                bestPos = l;
                bestLen = len;
            }
        }
        else l++;
    }
    cout << bestPos+1 << " " << bestLen;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: ACCEPTED

Test 54

Verdict: ACCEPTED

Test 55

Verdict: ACCEPTED

Test 56

Verdict: ACCEPTED

Test 57

Verdict: ACCEPTED

Test 58

Verdict: ACCEPTED

Test 59

Verdict: ACCEPTED

Test 60

Verdict: ACCEPTED

Test 61

Verdict: ACCEPTED

Test 62

Verdict: ACCEPTED

Test 63

Verdict: ACCEPTED

Test 64

Verdict: ACCEPTED