Moon landing

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
 
#define SEG_OP(a,b) max(a, b)
 
const int N = 1<<17;
 
struct Seg {
  int S[N*2];
 
  Seg(int x = 0) {
    for (int i = N; i < N*2; ++i) S[i] = x;
    for (int i = N-1; i >= 1; --i) S[i] = SEG_OP(S[i*2], S[i*2+1]);
  }
  void set(int i, int x) {
    i |= N;
    S[i] = x;
    for (i /= 2; i >= 1; i /= 2) {
      S[i] = SEG_OP(S[i*2], S[i*2+1]);
    }
  }
  ll get(int a, int b, ll s = 0) {
    a |= N; b |= N;
    while (a <= b) {
      if (a % 2 == 1) s = SEG_OP(s, ll(S[a++]));
      if (b % 2 == 0) s = SEG_OP(s, ll(S[b--]));
      a /= 2; b /= 2;
    }
    return s;
  }
};
#define SEG_OP2(a,b) min(a, b)
struct Seg2 {
  int S[N*2];
 
  Seg2(int x = 0) {
    for (int i = N; i < N*2; ++i) S[i] = x;
    for (int i = N-1; i >= 1; --i) S[i] = SEG_OP2(S[i*2], S[i*2+1]);
  }
  void set(int i, int x) {
    i |= N;
    S[i] = x;
    for (i /= 2; i >= 1; i /= 2) {
      S[i] = SEG_OP2(S[i*2], S[i*2+1]);
    }
  }
  ll get(int a, int b, ll s = 0) {
    a |= N; b |= N;
    while (a <= b) {
      if (a % 2 == 1) s = SEG_OP2(s, ll(S[a++]));
      if (b % 2 == 0) s = SEG_OP2(s, ll(S[b--]));
      a /= 2; b /= 2;
    }
    return s;
  }
};
 
int n, x;
Seg S;
Seg2 S2( 1e9 );
 
int main() {
	cin >> n >> x;
	for (int i = 0; i < n; ++i) {
		int a;
		cin >> a;
		S.set(i,a);
		S2.set(i,a);
	}
	int pos = 1, len = 0;
	for (int i = 0; i < n; ++i) {
		int l = -1;
		for (int j = 1<<17; j >= 1; j /= 2) {
			l += j;
			if (i + l >= n) {
				l -= j;
				continue;
			}
			if (S.get(i,i+l) - S2.get(i,i+l) > x) l -= j;
		}
		++l;
		if (l > len) {
			pos = i; len = l;
		}
	}
	cout << pos+1 << ' ' << len << '\n';
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: ACCEPTED

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: ACCEPTED

Test 6

Verdict: WRONG ANSWER

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: ACCEPTED

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: ACCEPTED

Test 22

Verdict: WRONG ANSWER

Test 23

Verdict: WRONG ANSWER

Test 24

Verdict: ACCEPTED

Test 25

Verdict: WRONG ANSWER

Test 26

Verdict: ACCEPTED

Test 27

Verdict: WRONG ANSWER

Test 28

Verdict: ACCEPTED

Test 29

Verdict: WRONG ANSWER

Test 30

Verdict: WRONG ANSWER

Test 31

Verdict: ACCEPTED

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: ACCEPTED

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: ACCEPTED

Test 49

Verdict: WRONG ANSWER

Test 50

Verdict: WRONG ANSWER

Test 51

Verdict: ACCEPTED

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