Educational Codeforces Round 94 (Rated for Div. 2) D. Zigzags

题目链接

思路：

遍历找相等，然后找相等的数之间的数和之后的相等数累加起来即可。

代码：

#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define endl '\n'
#define null NULL
#define ls p<<1
#define rs p<<1|1
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ll long long
#define int long long
#define pii pair<int,int>
#define pdd pair<double,double>
#define lowbit(x) x&-x
#define unmap unordered_map
#define all(x) x.begin(),x.end()
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ct cerr<<"Time elapsed:"<<1.0*clock()/CLOCKS_PER_SEC<<"s.\n";
char *fs,*ft,buf[1<<20];
#define gc() (fs==ft&&(ft=(fs=buf)+fread(buf,1,1<<20,stdin),fs==ft))?0:*fs++;
inline int read()
{
    int x=0,f=1;
    char ch=gc();
    while(ch<'0'||ch>'9')
    {
        if(ch=='-')
            f=-1;
        ch=gc();
    }
    while(ch>='0'&&ch<='9')
    {
        x=x*10+ch-'0';
        ch=gc();
    }
    return x*f;
}
using namespace std;
const int N=1e4+1000;
const int inf=0x3f3f3f3f;
const int mod=1e9+7;
const double eps=1e-6;
const double PI=acos(-1);
int a[N],b[N];
signed main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        for(int i=1;i<=n;i++)
            cin>>a[i];
        memset(b,0,sizeof b);
        b[a[n]]++;
        int res=0;
        for(int k=n-1;k>=3;k--)
        {
            int sum=0;
            sum+=b[a[k-1]];
            for(int i=k-2;i>=1;i--)
            {
                if(a[i]==a[k])
                {
                    res+=sum;
                }
                sum+=b[a[i]];
            }
            b[a[k]]++;
        }
        cout<<res<<endl;
    }
}