-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathD.cpp
38 lines (34 loc) · 817 Bytes
/
D.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
#include <bits/stdc++.h>
#define fi first
#define se second
#define db double
#define U unsigned
#define P std::pair<int,int>
#define LL long long
#define pb push_back
#define MP std::make_pair
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(int i = a;i <= b;++i)
#define ROF(i,a,b) for(int i = a;i >= b;--i)
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl
const int MAXN = 3000+5;
int a[MAXN],n;
int S[MAXN][MAXN];
inline void Solve(){
scanf("%d",&n);FOR(i,1,n) scanf("%d",a+i);
FOR(i,1,n) FOR(j,1,n) S[i][j] = 0;
LL ans = 0;
ROF(j,n,1){
FOR(i,1,j-1){
ans += S[a[i]][a[j]];
}
FOR(i,j+1,n) S[a[j]][a[i]]++;
}
printf("%lld\n",ans);
}
int main(){
int T;scanf("%d",&T);
while(T--) Solve();
return 0;
}