Moon landing

input/code.cpp: In function 'int solve()':
input/code.cpp:165:13: warning: unused variable 'mn' [-Wunused-variable]
  165 |         int mn=minq.query(i, lo), mx=maxq.query(i, lo);
      |             ^~
input/code.cpp:165:35: warning: unused variable 'mx' [-Wunused-variable]
  165 |         int mn=minq.query(i, lo), mx=maxq.query(i, lo);
      |                                   ^~

#ifdef ONPC
    #define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
 
#define char unsigned char
#define rep(i, a, b) for(int i=a; i< (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
 
#define LSOne(S) ((S) & -(S))
 
using namespace std;
// mt19937 rnd(239);
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
 
typedef long long C;
typedef complex<C> P;
#define X real()
#define Y imag()
 
template<class T>
istream& operator>> (istream& is, complex<T>& p) {
    T value;
    is >> value;
    p.real(value);
    is >> value;
    p.imag(value);
    return is;
}
 
typedef long long ll;
typedef long double ld;
 
using pi = pair<ll, ll>;
using vi = vector<ll>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;
 
int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
 
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
 
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef DEBUG
#define dbg(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
#define dbg(x...)
#endif
 
template<typename S, typename T = S> void chmin(S &s, T t) {s = s < t ? s : t;}
template<typename S, typename T = S> void chmax(S &s, T t) {s = s > t ? s : t;}
 
const int INF = 1e9; // 10^9 = 1B is < 2^31-1
const ll LLINF = 4e18; // 4*10^18 is < 2^63-1
const double EPS = 1e-9;
const ll MOD = 1e9+7;
 
struct rmaxq {
    vector<vector<int>> st;
    int n;
 
    rmaxq() {}
    rmaxq(vector<int> &v) {
        n = v.size();
        st = vector<vector<int>>(18, vector<int>(n));
        for (int j = 0; j < n; ++j) st[0][j] = v[j];
        for (int i = 0; (1 << i) <= n; ++i) {
            for (int j = 0; j + (1 << (i+1)) <= n; ++j) {
                st[i+1][j] = max(st[i][j], st[i][j + (1 << i)]);
            }
        }
    }
    
    int query(int l, int r) {
        if (l > r) return -1;
        int j = l == r ? 0 : 31 - __builtin_clz(r - l);
        return max(st[j][l], st[j][r - (1 << j) + 1]);
    }
};
 
struct rminq {
    vector<vector<int>> st;
    int n;
 
    rminq() {}
    rminq(vector<int> &v) {
        n = v.size();
        st = vector<vector<int>>(18, vector<int>(n));
        for (int j = 0; j < n; ++j) st[0][j] = v[j];
        for (int i = 0; (1 << i) <= n; ++i) {
            for (int j = 0; j + (1 << (i+1)) <= n; ++j) {
                st[i+1][j] = min(st[i][j], st[i][j + (1 << i)]);
            }
        }
    }
    
    int query(int l, int r) {
        if (l > r) return -1;
        int j = l == r ? 0 : 31 - __builtin_clz(r - l);
        return min(st[j][l], st[j][r - (1 << j) + 1]);
    }
};
 
 
int solve() {
    int n, x; std::cin >> n >> x;
    vector<int> v(n);
    for (int i = 0; i < n; i++) {
        std::cin >> v[i];
    }
 
    rminq minq(v);
    rmaxq maxq(v);
 
    //std::cout << minq.query(0, 2) << std::endl;
    
    pair<int,int> res={1, 1};
 
    for (int i = 0; i < n; i++) {
        int lo=i, hi=n-1;
        //std::cout << lo << " " << hi << std::endl;
        while(lo<hi) {
            int mid=(lo+hi+1)/2;
            int mn=minq.query(i, mid), mx=maxq.query(i, mid);
            if(mx-mn<=x) {
                lo=mid;
            } else {
                hi=mid-1;
            }
        }
 
        int mn=minq.query(i, lo), mx=maxq.query(i, lo);
        //std::cout << i << ": " << lo  << std::endl;
        //std::cout << mn << " " << mx << std::endl;
        
        if(lo-i+1>=res.se) {
            res.se=lo-i+1;
            res.fi=i+1;
        }
    }
 
    std::cout << res.fi << " " << res.se << std::endl;
 
    //__print(res); std::cout  << std::endl;
 
    
    return 0;
}
 
int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TET = 1;
    //cin >> TET;
    for (int i = 1; i <= TET; i++) {
        #ifdef ONPC
            cout << "TEST CASE#" << i << endl;
        #endif
        
        if (solve()) {
            break;
        }
 
        #ifdef ONPC
            cout << "__________________________" << endl;
        #endif
    }
    #ifdef ONPC
        cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
    #endif
}

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