Submission #855858

---

Source Code Expand

#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <list>

using namespace std;

typedef long long ll;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(d) string(1,d)
#define print(x) cout<<#x<<" = "<<x<<endl;

#define MOD 1000000007

ll d[1005][1005];
ll dp[1005];

int main() {
  ll n;
  cin>>n;
  vector<ll> v;
  rep(i,0,n){
    ll a;
    cin>>a;
    v.pb(a);
  }
  ll l,q;
  cin>>l>>q;
  vector<pair<ll,ll> > vq;
  rep(i,0,q){
    ll a,b;
    cin>>a>>b;
    vq.pb(mp(min(a,b),max(a,b)));
  }
  if(n>1000||q>1000)return 0;
  clr(d,0);
  rep(i,0,v.sz){
    rep(j,i+1,v.sz){
      if(v[j]-v[i]<=l){
        d[i][j] = 1;
      }
    }
  }
  rep(i,0,1005)dp[i] = 100000;
  dp[0] = 0;
  rep(i,0,v.sz){
    rep(j,i+1,v.sz){
      if(d[i][j]==1){
        dp[j] = min(dp[j],dp[i]+1);
      }
    }
  }
  rep(i,0,vq.sz){
    ll a = vq[i].fi;
    ll b = vq[i].se;
    cout << dp[b]-dp[a] << endl;
  }
  return 0;
}

Submission Info

Judge Result