Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <algorithm>
- using namespace std;
- int main(){
- long long n,q,k;
- cin >> n >> q >>k;
- vector<long long> a(n);
- for(long long i =0;i<n;i++){
- cin>>a[i];
- }
- for(long long i=1;i<=q;i++){
- long long outp =1;
- long long l,r;
- cin >> l >>r;
- vector <long long> b(r-l+1);
- for(long long j = 0;j<=r-l;j++)b[j] = a[j+l-1];
- sort(b.begin(),b.end());
- for(long long j=0;j<r-l;j++){
- if(b[j+1]-b[j]>k) outp++;
- }
- cout << outp << " ";
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement