Moon landing

input/code.cpp: In function 'int main()':
input/code.cpp:15:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   15 |     for (int i = 0; i < n; i++)
      |     ^~~
input/code.cpp:18:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   18 |         deque<int> maxElementStorage;
      |         ^~~~~
input/code.cpp:23:45: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |         for (int right = 0, left = 0; right < nums.size(); right++)
      |                                       ~~~~~~^~~~~~~~~~~~~

// Online C++ compiler to run C++ program online
#include <iostream>
#include <vector>
#include <climits>
#include <deque>
 
using namespace std;
 
int main() {
    // Amount of numbers, max height difference
    int n, limit;
    cin >> n >> limit;
    
    vector<int> nums(n);
    for (int i = 0; i < n; i++)
        cin >> nums[i];

        deque<int> maxElementStorage;
        deque<int> minElementStorage;
        int maxLength = 0;
        int maxIdx = 0;

        for (int right = 0, left = 0; right < nums.size(); right++)
        {
            // Check this new element against both of the arrays. If it is superior,
            // there is no situation where we would use the other elements at the back as they
            // would be removed before this one. We can remove them so that we'll be able 
            // to insert this into the correct place
            while (!maxElementStorage.empty() && nums[right] > maxElementStorage.back())
                maxElementStorage.pop_back();
            maxElementStorage.push_back(nums[right]);

            while (!minElementStorage.empty() && nums[right] < minElementStorage.back())
                minElementStorage.pop_back();
            minElementStorage.push_back(nums[right]);

            // Now we need to move left ptr. Move it until we are again within
            // the bounds of the limit
            while (maxElementStorage.front() - minElementStorage.front() > limit)
            {
                if (nums[left] == maxElementStorage.front())
                    maxElementStorage.pop_front();
                if (nums[left] == minElementStorage.front())
                    minElementStorage.pop_front();
                left++;
            }
            
            // Check the min and max values against the limit. Update maxLength
            if (right - left + 1 > maxLength)
            {
                maxLength = right - left + 1;
                maxIdx = left;
            }
        }

        cout << maxIdx << " " << maxLength;
    
 
    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: ACCEPTED

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: ACCEPTED

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: WRONG ANSWER

Test 22

Verdict: WRONG ANSWER

Test 23

Verdict: WRONG ANSWER

Test 24

Verdict: ACCEPTED

Test 25

Verdict: WRONG ANSWER

Test 26

Verdict: WRONG ANSWER

Test 27

Verdict: ACCEPTED

Test 28

Verdict: WRONG ANSWER

Test 29

Verdict: WRONG ANSWER

Test 30

Verdict: WRONG ANSWER

Test 31

Verdict: WRONG ANSWER

Test 32

Verdict: WRONG ANSWER

Test 33

Verdict: WRONG ANSWER

Test 34

Verdict: WRONG ANSWER

Test 35

Verdict: WRONG ANSWER

Test 36

Verdict: WRONG ANSWER

Test 37

Verdict: WRONG ANSWER

Test 38

Verdict: WRONG ANSWER

Test 39

Verdict: WRONG ANSWER

Test 40

Verdict: WRONG ANSWER

Test 41

Verdict: WRONG ANSWER

Test 42

Verdict: WRONG ANSWER

Test 43

Verdict: WRONG ANSWER

Test 44

Verdict: WRONG ANSWER

Test 45

Verdict: WRONG ANSWER

Test 46

Verdict: WRONG ANSWER

Test 47

Verdict: WRONG ANSWER

Test 48

Verdict: WRONG ANSWER

Test 49

Verdict: WRONG ANSWER

Test 50

Verdict: WRONG ANSWER

Test 51

Verdict: WRONG ANSWER

Test 52

Verdict: WRONG ANSWER

Test 53

Verdict: WRONG ANSWER

Test 54

Verdict: WRONG ANSWER

Test 55

Verdict: WRONG ANSWER

Test 56

Verdict: WRONG ANSWER

Test 57

Verdict: WRONG ANSWER

Test 58

Verdict: WRONG ANSWER

Test 59

Verdict: WRONG ANSWER

Test 60

Verdict: WRONG ANSWER

Test 61

Verdict: WRONG ANSWER

Test 62

Verdict: WRONG ANSWER

Test 63

Verdict: WRONG ANSWER

Test 64

Verdict: ACCEPTED