Moon landing

input/code.cpp: In function 'int main()':
input/code.cpp:103:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |     while(idx2<moon.size()){
      |           ~~~~^~~~~~~~~~~~

#include <iostream>
#include <vector>
#include <climits>
using namespace std;

class SegmentTreeMin {
    vector<int> tree;
    int n;

public:
    SegmentTreeMin(const vector<int>& array) {
        n = array.size();
        tree.resize(2 * n);
        build(array);
    }

    void build(const vector<int>& array) {
        for (int i = 0; i < n; i++)
            tree[n + i] = array[i];
        for (int i = n - 1; i > 0; --i)
            tree[i] = min(tree[2 * i], tree[2 * i + 1]);
    }

    int rangeMin(int l, int r) {
        int minVal = INT_MAX;
        l += n; r += n;
        while (l < r) {
            if (l & 1) minVal = min(minVal, tree[l++]);
            if (r & 1) minVal = min(minVal, tree[--r]);
            l >>= 1; r >>= 1;
        }
        return minVal;
    }

    void update(int idx, int value) {
        idx += n;
        tree[idx] = value;
        for (idx >>= 1; idx > 0; idx >>= 1) {
            tree[idx] = min(tree[2 * idx], tree[2 * idx + 1]);
        }
    }
};


class SegmentTreeMax {
    vector<int> tree;
    int n;

public:
    SegmentTreeMax(const vector<int>& array) {
        n = array.size();
        tree.resize(2 * n);
        build(array);
    }

    void build(const vector<int>& array) {
        for (int i = 0; i < n; i++)
            tree[n + i] = array[i];
        for (int i = n - 1; i > 0; --i)
            tree[i] = max(tree[2 * i], tree[2 * i + 1]);
    }

    int rangeMax(int l, int r) {
        int maxVal = INT_MIN;
        l += n; r += n;
        while (l < r) {
            if (l & 1) maxVal = max(maxVal, tree[l++]);
            if (r & 1) maxVal = max(maxVal, tree[--r]);
            l >>= 1; r >>= 1;
        }
        return maxVal;
    }

    void update(int idx, int value) {
        idx += n;
        tree[idx] = value;
        for (idx >>= 1; idx > 0; idx >>= 1) {
            tree[idx] = max(tree[2 * idx], tree[2 * idx + 1]);
        }
    }
};

int main(){
    int n,x;
    cin >> n >> x;
    vector<int> moon(n);

    for(int i=0; i<n; i++) cin >> moon[i];

    SegmentTreeMax STMAX(moon); 
    SegmentTreeMin STMIN(moon);

    int idx1,idx2;
    idx1 = 0;
    idx2 = 0;
    int dist=1;

    int pos=0;
    int max_dist=1;
    


    while(idx2<moon.size()){

        int max=STMAX.rangeMax(idx1,idx2+1);
        int min=STMIN.rangeMin(idx1,idx2+1);

        

        if((dist>max_dist) and ((max-min)<=x)){
            max_dist=dist;
            pos=idx1;

            idx2 += 1;
            dist += 1;
        }
        else if((max-min)>x){
            
            idx1 = idx2;
            dist=1;
        }
        else{
            idx2 += 1;
            dist += 1;

        }



        //cout << idx1 <<endl;
        

    }

    cout<<pos+1<<" "<<dist<<endl;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: ACCEPTED

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: ACCEPTED

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

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: WRONG ANSWER

Test 25

Verdict: ACCEPTED

Test 26

Verdict: WRONG ANSWER

Test 27

Verdict: WRONG ANSWER

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: WRONG ANSWER