ICPC 2019-2020 North-Western Russia Regional Contest M a[j]-a[i]+a[j]=a[k]

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t,n;
    scanf("%d",&t);
    int a[2006];
    map<int,int>s;
    while(t--)
    {
        s.clear();
        scanf("%d",&n);
        long long ans=0;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            s[a[i]]++;///个数
        }
        s[a[1]]--;
        for(int j=2;j<=n;j++)
        {
            s[a[j]]--;///k>j
            for(int i=1;i<j;i++)
            {
                int p=a[j]-a[i]+a[j];///第三个数等于中间的数+差
                //cout<<a[j]<<" "<<a[i]<<" "<<p<<" "<<s[p]<<endl;
                if(s.count(p))ans+=s[p];///没有s.count会超时
            }
        }
        printf("%lld\n",ans);
    }
    return 0;
}