1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148

#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
using namespace std;

const int MAXN = 210000,LOGN = 20;

namespace SA{
  int s[MAXN],sa[MAXN],ht[MAXN],x[MAXN],y[MAXN],rk[MAXN],cnt[MAXN];
  void get_sa(int n,int m){
    for(int i = 0;i<m;i++) cnt[i] = 0;
    for(int i = 0;i<n;i++) cnt[s[i]]++;
    for(int i = 1;i<m;i++) cnt[i] += cnt[i-1];
    for(int i = n-1;~i;--i) sa[--cnt[s[i]]] = i;
    m = rk[sa[0]] = 0;
    for(int i = 1;i<n;i++) rk[sa[i]] = s[sa[i]] == s[sa[i-1]]?m:++m;
    for(int j = 1;;j<<=1){
      if(++m == n) break;
      for(int i = 0;i<j;i++) y[i] = n-j+i;
      for(int i = 0,k = j;i<n;i++) if(sa[i] >= j) y[k++] = sa[i] - j;
      for(int i = 0;i<n;i++) x[i] = rk[y[i]];
      for(int i = 0;i<m;i++) cnt[i] = 0;
      for(int i = 0;i<n;i++) cnt[x[i]]++;
      for(int i = 1;i<m;i++) cnt[i] += cnt[i-1];
      for(int i = n-1;~i;--i) sa[--cnt[x[i]]] = y[i],y[i] = rk[i];
      m = rk[sa[0]] = 0;
      for(int i = 1;i<n;i++) rk[sa[i]] = (y[sa[i]] == y[sa[i-1]] && y[sa[i]+j] == y[sa[i-1]+j]?m:++m);
    }
  }
  void get_height(int n){
    for(int i = 0,h = ht[0] = 0;i<n;i++){
      int j = sa[rk[i]-1];
      while(i+h<n && j+h<n && s[i+h] == s[j+h]) h++;
      ht[rk[i]] = h;
      if(h) --h;
    }
  }
  void solve(int n,int m,int *a){
    for(int i = 0;i<n;i++) s[i] = a[i];
    s[n++] = 0;
    get_sa(n,m),get_height(n);
  }
}

namespace ST{
  int minn[MAXN][LOGN];
  void init(int n,int *a){
    for(int i = 1;i<=n;i++) minn[i][0] = a[i];
    for(int j = 1;j<LOGN;j++)
      for(int i = 1;i + (1<<(j-1)) <= n;i++)
        minn[i][j] = min(minn[i][j-1],minn[i+(1<<(j-1))][j-1]);
  }
  int query(int l,int r){
    int t = log2(r-l+1);
    return min(minn[l][t],minn[r-(1<<t)+1][t]);
  }
}

int _q(int l,int r){
  return l == r ? inf : ST::query(l+1,r);
}

int rt[MAXN];

namespace CMT{
  int ls[MAXN*LOGN],rs[MAXN*LOGN],sumn[MAXN*LOGN],cnt;
  #define mid ((l+r)/2)
  void insert(int &nown,int pre,int l,int r,int pos,int v){
    nown = ++cnt;ls[nown] = ls[pre],rs[nown] = rs[pre],sumn[nown] = sumn[pre];
    if(l == r) sumn[nown] += v;
    else{
      if(pos <= mid) insert(ls[nown],ls[pre],l,mid,pos,v);
      if(pos >= mid+1) insert(rs[nown],rs[pre],mid+1,r,pos,v);
      sumn[nown] = sumn[ls[nown]] + sumn[rs[nown]];
    }
  }
  int query(int nown,int l,int r,int ql,int qr){
    if(!nown) return 0;
    if(ql <= l && r <= qr) return sumn[nown];
    else{
      int ans = 0;
      if(ql <= mid) ans += query(ls[nown],l,mid,ql,qr);
      if(qr >= mid+1) ans += query(rs[nown],mid+1,r,ql,qr);
      return ans;
    }
  }
  #undef mid
}

map<int,int> S;
int n,len,m,q,h[MAXN],g[MAXN];

void init(){
  scanf("%d",&n);
  for(int i = 0;i<n;i++){
    scanf("%d",&h[i]);
    if(i) g[i-1] = h[i] - h[i-1];
  }
  g[n-1] = h[n]-h[n-1],g[n] = 2e9+1;
  len = 2*n+1;
  for(int i = 1;i<=n;i++) g[n+i] = -g[i-1];

  for(int i = 0;i<len;i++) S[g[i]] = 0;
  for(auto it = S.begin();it != S.end();it++) it->second = ++m; 
  m++;
  for(int i = 0;i<len;i++) g[i] = S[g[i]];
}

int query_cmt(int lb,int rb,int l,int r){
  return CMT::query(rt[rb],0,len,l,r) - CMT::query(rt[lb-1],0,len,l,r);
}

int query(int L,int R){
  if(L == R) return n-1;
  int pos = SA::rk[L],l = R-L,lb,rb;
  int LL = 0,RR = pos;
  while(LL != RR){
    int mid = (LL+RR)/2;
    if(_q(mid,pos) >= l) RR = mid;
    else                 LL = mid+1;
  }
  lb = LL;
  LL = pos,RR = len;
  while(LL != RR){
    int mid = (LL+RR+1)/2;
    if(_q(pos,mid) >= l) LL = mid;
    else                 RR = mid-1;
  }
  rb = LL;
  return query_cmt(lb,rb,n+1,len) - query_cmt(lb,rb,max(n+1,n+L-l+1),n+R+1);
  return 0;
}

void solve(){
  SA::solve(len,m,g),ST::init(len,SA::ht);
  for(int i = 1;i<len;i++) CMT::insert(rt[i],rt[i-1],0,len,SA::sa[i],1);
  scanf("%d",&q);
  for(int i = 1;i<=q;i++){
    int l,r;
    scanf("%d %d",&l,&r);
    printf("%d\n",query(l-1,r-1));
  }
}

int main(){
  init();
  solve();
  return 0;
}