Submission #856583

---

Source Code Expand

#include <cmath>
#include <vector>
#include <iostream>
#include <limits>
#include <iostream>
#include <vector>
#include <cassert>
#include <complex>
#include <cstring>
#include <map>
#include <cmath>
#include <set>
#include <algorithm>
#include <queue>

using namespace std;
typedef long long Long;

Long nex[100010][20];

int main(){
	
	int N;
	cin >> N;
	vector<int> X(N);
	for(int &v : X)
		cin >> v;
	N++;
	X.push_back(X.back());
	int L;
	cin >> L;
	// nex 0
	for(int i = 0; i < N; ++i){
		int nX = X[i]+L;
		int p = upper_bound(X.begin(),X.end(),nX) - X.begin();
		p--;
		nex[i][0] = p;
	}
	for(int i = 1; i < 20; ++i){
		for(int j = 0; j < N; ++j){
			nex[j][i] = nex[ nex[j][i-1] ][i-1];
		}
	}
	int Q;
	cin >> Q;
	for(int i = 0; i < Q; ++i){
		int a,b;
		cin >> a >> b;
		a--;b--;
		if(a > b)swap(a,b);
		int c = 0;
		for(int i = 19; i >= 0; --i){
			if(nex[a][i] < b){
				c += (1<<i);
				a = nex[a][i];
			}
		}
		c++;
		cout << c << endl;
	}
	
}


/*


 */

Submission Info

Judge Result