Moon landing

#include <iostream>
#include <vector>
#include <deque>
#include <algorithm>

using namespace std;

pair<int, int> findLongestStrip(const vector<int>& heights, int x) {
    deque<int> maxDeque, minDeque;
    int n = heights.size();
    int longestLength = 0, bestStart = 0;
    int windowStart = 0;

    for (int windowEnd = 0; windowEnd < n; ++windowEnd) {
        // Insert current height into the deques for max and min
        while (!maxDeque.empty() && heights[maxDeque.back()] <= heights[windowEnd]) {
            maxDeque.pop_back();
        }
        maxDeque.push_back(windowEnd);

        while (!minDeque.empty() && heights[minDeque.back()] >= heights[windowEnd]) {
            minDeque.pop_back();
        }
        minDeque.push_back(windowEnd);

        // Check if the current window is valid
        while (heights[maxDeque.front()] - heights[minDeque.front()] > x) {
            windowStart++;
            if (maxDeque.front() < windowStart) maxDeque.pop_front();
            if (minDeque.front() < windowStart) minDeque.pop_front();
        }

        // Update the best solution found so far
        int currentLength = windowEnd - windowStart + 1;
        if (currentLength > longestLength) {
            longestLength = currentLength;
            bestStart = windowStart;
        }
    }

    return {bestStart + 1, longestLength}; // +1 to convert to 1-based indexing
}

int main() {
    int n, x;
    cin >> n >> x;
    vector<int> heights(n);
    
    for (int i = 0; i < n; ++i) {
        cin >> heights[i];
    }

    pair<int, int> result = findLongestStrip(heights, x);
    cout << result.first << " " << result.second << endl;

    return 0;
}

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