Language: C++

#include<bits/stdc++.h>

using namespace std;
#define REP(i,n) for(int (i)=0;i<(int)(n);i++)
#define all(hoge) (hoge).begin(),(hoge).end()
typedef vector<int> Array;

int l[20][202020];
int r[20][202020];
int dp1[20][202020];
int dp2[20][202020];

int main() {
	ll n, k;
	cin >> n >> k;
	Array x(n);
	REP(i, n)cin >> x[i];
	REP(i, n)dp1[0][i] = l[0][i] = lower_bound(all(x), x[i] + k) - x.begin();
	REP(i, n)dp2[0][i] = r[0][i] = upper_bound(all(x), x[i] - k) - x.begin() - 1;
	REP(i, 19)REP(j, n)l[i + 1][j] = l[i][min(n - 1, l[i][j])];
	REP(i, 19)REP(j, n)r[i + 1][j] = r[i][max(0LL, r[i][j])];
	REP(i, 19)REP(j, n)dp1[i + 1][j] = dp1[i][j] + dp1[i][l[i][j]];
	REP(i, 19)REP(j, n)dp2[i + 1][j] = dp2[i][j] + dp2[i][r[i][j]];
	int q;
	cin >> q;
	while (q--) {
		int L, R;
		cin >> L >> R;
		L--;
		int ans = R - L;
		int x = L, y = R - 1;
		for (int i = 19; i >= 0; i--) {
			if (l[i][x] < R)ans += (1LL << i) - dp1[i][x], x = l[i][x];
			if (r[i][y] >= L)ans += dp2[i][y], y = r[i][y];
		}
		cout << ans << "\n";
	}

	return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:14:9: error: 'll' was not declared in this scope; did you mean 'l'?
   14 |         ll n, k;
      |         ^~
      |         l
a.cc:15:16: error: 'n' was not declared in this scope; did you mean 'yn'?
   15 |         cin >> n >> k;
      |                ^
      |                yn
a.cc:15:21: error: 'k' was not declared in this scope
   15 |         cin >> n >> k;
      |                     ^
a.cc:21:50: error: no matching function for call to 'max(long long int, int&)'
   21 |         REP(i, 19)REP(j, n)r[i + 1][j] = r[i][max(0LL, r[i][j])];
      |                                               ~~~^~~~~~~~~~~~~~
In file included from /usr/include/c++/14/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h:257:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  257 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:257:5: note:   template argument deduction/substitution failed:
a.cc:21:50: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   21 |         REP(i, 19)REP(j, n)r[i + 1][j] = r[i][max(0LL, r[i][j])];
      |                                               ~~~^~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  303 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note:   candidate expects 3 arguments, 2 provided
In file included from /usr/include/c++/14/algorithm:61:
/usr/include/c++/14/bits/stl_algo.h:5706:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)'
 5706 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5706:5: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5716:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)'
 5716 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5716:5: note:   template argument deduction/substitution failed:
a.cc:21:50: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   21 |         REP(i, 19)REP(j, n)r[i + 1][j] = r[i][max(0LL, r[i][j])];
      |                                               ~~~^~~~~~~~~~~~~~