题目:https://codeforces.com/contest/1462/problem/E1
题目:
代码:
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long int LL;
const int N = 2e5 + 10;
LL a[N];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--)
{
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + 1 + n);
long long int l = 1;
LL ans = 0;
for (int i = 1; i <= n; i++)
{
while (a[i] - a[l] > 2)
{
l++;
}
LL len = i - 1 - l + 1;
if (len >= 2)
{
ans += (len - 1) * len / 2;
}
}
cout << ans << endl;
}
return 0;
}