Submission #855676

---

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;



int main(){

	int N;
	cin >> N;
	vector<int> V(N);
	for(int &v : V)cin >> v;
	int Q,L;
	cin >> L >> 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, s = 0;
		for(int j = a+1; j <= b; ++j){
			int t = V[j] - V[j-1];
			if(s + t > L){
				c++;
				s = 0;
			}
			s += t;
		}
		if(s){
			c++;
		}
		cout << c << endl;
	}
}


/*

Ax + B = S



 */

Submission Info

Judge Result