Submission #9903111

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
    int n, k; cin >> n >> k;
    vector<int> a(n);
    for (auto &ai: a) cin >> ai;
    long long cnt = 0, left = 0, right = 0;
    for (int mid = 0; mid < n; mid++) {
        while (left < mid && a[mid] - a[left] > k) left++;
        while (right < n && a[right] - a[mid] <= k) right++;
        cnt += (right - mid) * (mid - left);
        cnt -= (right - mid) * ((right - mid) - 1) / 2;
    }
    cout << cnt << endl;
    return 0;
}

Submission Info

Judge Result