高橋君とホテル / Tak and Hotels

高橋君とホテル / Tak and Hotels

---

Time limit : 3sec / Stack limit : 256MB / Memory limit : 256MB

Score : 700 points

Problem Statement

N hotels are located on a straight line. The coordinate of the i-th hotel (1≤i≤N) is xi.

Tak the traveler has the following two personal principles:

• He never travels a distance of more than L in a single day.
• He never sleeps in the open. That is, he must stay at a hotel at the end of a day.

You are given Q queries. The j-th (1≤j≤Q) query is described by two distinct integers aj and bj. For each query, find the minimum number of days that Tak needs to travel from the aj-th hotel to the bj-th hotel following his principles. It is guaranteed that he can always travel from the aj-th hotel to the bj-th hotel, in any given input.

Constraints

• 2≤N≤105
• 1≤L≤109
• 1≤Q≤105
• 1≤xi<x2<…<xN≤109
• xi+1−xi≤L
• 1≤aj,bj≤N
• aj≠bj
• N, L, Q, xi, aj, bj are integers.

Partial Score

• 200 points will be awarded for passing the test set satisfying N≤103 and Q≤103.

---

Input

The input is given from Standard Input in the following format:

N
x1 x2 … xN
L
Q
a1 b1
a2 b2
:
aQ bQ

Output

Print Q lines. The j-th line (1≤j≤Q) should contain the minimum number of days that Tak needs to travel from the aj-th hotel to the bj-th hotel.

---

Sample Input 1

9
1 3 6 13 15 18 19 29 31
10
4
1 8
7 3
6 7
8 5

Sample Output 1

4
2
1
2

For the 1-st query, he can travel from the 1-st hotel to the 8-th hotel in 4 days, as follows:

• Day 1: Travel from the 1-st hotel to the 2-nd hotel. The distance traveled is 2.
• Day 2: Travel from the 2-nd hotel to the 4-th hotel. The distance traveled is 10.
• Day 3: Travel from the 4-th hotel to the 7-th hotel. The distance traveled is 6.
• Day 4: Travel from the 7-th hotel to the 8-th hotel. The distance traveled is 10.

分析：对于每个点二分可以找到一天所能到达的最右和最左端点；

　　　然后关键就是倍增，这样每个小问题就可以在log复杂度解决了；

代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <list>
#define rep(i,m,n) for(i=m;i<=n;i++)
#define rsp(it,s) for(set<int>::iterator it=s.begin();it!=s.end();it++)
#define mod 1000000000
#define inf 0x3f3f3f3f
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define pi acos(-1.0)
#define pii pair<int,int>
#define Lson L, mid, rt<<1
#define Rson mid+1, R, rt<<1|1
const int maxn=1e5+;
using namespace std;
ll gcd(ll p,ll q){return q==?p:gcd(q,p%q);}
ll qpow(ll p,ll q){ll f=;while(q){if(q&)f=f*p;p=p*p;q>>=;}return f;}
int n,m,k,t,l[][maxn],r[][maxn];
ll a[maxn],p;
void init()
{
    memset(l,-,sizeof l);
    memset(r,-,sizeof r);
    for(int i=;i<=n-;i++)
    {
        r[][i]=lower_bound(a,a+n,a[i]+p)-a;
        if(r[][i]==n||a[r[][i]]>a[i]+p)r[][i]--;
        l[][i]=lower_bound(a,a+n,a[i]-p)-a;
        if(i==n-)r[][i]=-;
        if(i==)l[][i]=-;
    }
    for(int i=;i<=;i++)
    {
        for(int j=;j<=n-;j++)
        {
            if(r[i-][j]<n-)r[i][j]=r[i-][r[i-][j]];
            if(l[i-][j]>)l[i][j]=l[i-][l[i-][j]];
        }
    }
}
int main()
{
    int i,j;
    scanf("%d",&n);
    rep(i,,n-)scanf("%lld",&a[i]);
    scanf("%lld",&p);
    init();
    int q;
    scanf("%d",&q);
    while(q--)
    {
        int b,c,ans=;
        scanf("%d%d",&b,&c);
        b--,c--;
        if(b<c)
        {
            for(i=;i>=;i--)
            {
                if(r[i][b]!=-&&r[i][b]<=c)
                {
                    ans+=qpow(,i);
                    b=r[i][b];
                    if(b==c)break;
                }
            }
            if(i==-)ans++;
        }
        else
        {
            for(i=;i>=;i--)
            {
                if(l[i][b]!=-&&l[i][b]>=c)
                {
                    ans+=qpow(,i);
                    b=l[i][b];
                    if(b==c)break;
                }
            }
            if(i==-)ans++;
        }
        printf("%d\n",ans);
    }
    //system("Pause");
    return ;
}