#include <iostream>
#include<vector>
#include<set>
using namespace std;
int main() {
vector<int> nums={2,6,4,3,6,8,9};
int low=0;
int high=0;
int count=0;
int k=3;
multiset<int> s;
for(int high=0;high<nums.size();high++) {
s.insert(nums[high]);
while(*s.rbegin()-*s.begin()>k) {
s.erase(s.find(nums[low]));
low++;
}
count+=high-low+1;
}
cout<<count<<endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTx2ZWN0b3I+CiNpbmNsdWRlPHNldD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewoJdmVjdG9yPGludD4gbnVtcz17Miw2LDQsMyw2LDgsOX07CglpbnQgbG93PTA7CglpbnQgaGlnaD0wOwoJaW50IGNvdW50PTA7CglpbnQgaz0zOwoJbXVsdGlzZXQ8aW50PiBzOwoJCglmb3IoaW50IGhpZ2g9MDtoaWdoPG51bXMuc2l6ZSgpO2hpZ2grKykgewoJCXMuaW5zZXJ0KG51bXNbaGlnaF0pOwoJCXdoaWxlKCpzLnJiZWdpbigpLSpzLmJlZ2luKCk+aykgewoJCQlzLmVyYXNlKHMuZmluZChudW1zW2xvd10pKTsKCQkJbG93Kys7CgkJfSAKCQljb3VudCs9aGlnaC1sb3crMTsKCX0KCWNvdXQ8PGNvdW50PDxlbmRsOwoJcmV0dXJuIDA7Cn0=