Submission #856794

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;

int main(){
    int N, L, Q, a, b, cur, c, ans;
    vector<int>::iterator yam;
    vector<int> x;

    cin >> N;
    x.push_back(0);
    for(int i = 0; i < N; i++){
        cin >> c;
        x.push_back(c);
    }
    cin >> L;
    cin >> Q;
    for(int i = 0; i < Q; i++){
        ans = 1;
        cin >> a >> b;
        if(a > b)swap(a, b);
        cur = x[a];
        yam = x.begin();
        while(1){
            yam = (upper_bound(yam, x.end(), cur + L) - 1);
            cur = *yam;
            if(cur >= x[b])break;
            else ans++;
        }
        cout << ans << endl;
        //cout << cur << endl;
        //cout << x[a] << " " << x[b] << endl;
    }
       



    return 0;
}

Submission Info

Judge Result