Moon landing

#include <bits/stdc++.h>
using namespace std;

using ll=long long;
using vl=vector<ll>;
#define all(c) begin(c),end(c)
#define pb push_back
#define sz(c) ll((c).size())

#define FOR(i,a,b) for(ll i=(a);i<(b);i++)

#define TR(x) ({ if(1) cout << __LINE__ << ": " #x " = " << (x) << endl; })

// Only when needed
using dd = double;
const dd eps = 1e-10;
using vd = vector<dd>;
using vvd = vector<vd>;
using vvl = vector<vl>;

#define log2(X) (63 - __builtin_clzll(ll(X))) // floor(log2(x))
// For range _maximum_ query change <= at (A) and (B) to >=
// Change to strict comparision at (A) and (B) to get the rightmost index
struct RMQ {
	vl data;		// Don't change Data after initialization (or remove &)
	vvl imin;   // [i][j]=min. Index eines Minimums im Intervall [i,i+2^j)
	void init(const vl &Data){
		data = Data;
		imin.assign(sz(Data), vl(32));
		ll N = sz(data);
		FOR(i, 0, N) imin[i][0] = i;
		FOR(j, 1, log2(N) + 1) FOR(i, 0, N - (1 << j) + 1) {
			ll i1 = imin[i][j - 1];
			ll i2 = imin[i + (1 << (j - 1))][j - 1];
			imin[i][j] = (data[i1] <= data[i2]) ? i1 : i2; // (A)
		}
	}
	// Returns leftmost index of minimum in interval [a, b)
	ll query(ll a, ll b) {  // [a, b) !!!  0 <= a < b <= N; complexity O(1)
		ll n = log2(b - a);
		b -= (1 << n);
		return data[imin[a][n]] <= data[imin[b][n]] ? imin[a][n] : imin[b][n]; // (B)
	}
};


void solve(){
	ll n, x; cin >> n >> x;
	vl a(n);
	FOR(i, 0, n) cin >> a[i];
	RMQ rmq, rmq2;
	rmq.init(a);
	vl a2 = a;
	for(ll &x : a2) x = -x;
	rmq2.init(a2);

	pair<ll, ll> best = {-1, -1};
	FOR(mxi, 0, n){
		ll l, r;
		ll lo = 0, hi = mxi;
		while(lo < hi){
			ll mid = (lo + hi) / 2;
			if(a[mxi] - a[rmq.query(mid, mxi + 1)] <= x && a[mxi] - a[rmq2.query(mid, mxi + 1)] >= 0)
				hi = mid;
			else lo = mid + 1;
		}
		l = lo;
		lo = mxi + 1, hi = n;
		while(lo < hi){
			ll mid = (lo + hi + 1) / 2;
			if(a[mxi] - a[rmq.query(mxi, mid)] <= x && a[mxi] - a[rmq2.query(mxi, mid)] >= 0)
				lo = mid;
			else hi = mid - 1;
		}
		r = lo;
		best = max(best, {r - l, l});
	}
	cout << best.second + 1 << " " << best.first << endl;
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
	solve();
}

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