codeforces D. Zigzags

题目

题意：

给你一个序列$a$，问你有几个四元组满足$i<j<k<l,a_i=a_k,a_j=a_l$。

思路：

因为$a_i=a_k,a_j=a_l\to a_i\ast maxn+a_j=a_k\ast maxn+a_l$，所以我们可以枚举$j$，那么也就是记录下来$a_i\ast maxn+a_{j-1}$，然后计算$ans=ans+cnt[a[k]\ast maxn+a[l]],k=j$，这样就把此时$a_j$为$j$的全部可能都计算出来了。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <deque>
#include <stack>
#include <cctype>
using namespace std;
typedef long long ll;
typedef vector<int> veci;
typedef vector<ll> vecl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <class T>
inline void read(T &ret) {
    char c;
    int sgn;
    if (c = getchar(), c == EOF) return ;
    while (c != '-' && (c < '0' || c > '9')) c = getchar();
    sgn = (c == '-') ? -1:1;
    ret = (c == '-') ? 0:(c - '0');
    while (c = getchar(), c >= '0' && c <= '9') ret = ret * 10 + (c - '0');
    ret *= sgn;
    return ;
}
inline void outi(int x) {if (x > 9) outi(x / 10);putchar(x % 10 + '0');}
inline void outl(ll x) {if (x > 9) outl(x / 10);putchar(x % 10 + '0');}
const int maxn = 3e3 + 10;
int a[maxn] = {0}, cnt[maxn * maxn];
int main() {
    int t; read(t); while (t--) {
        memset(cnt, 0, sizeof(cnt));
        int n; read(n);
        for (int i = 1; i <= n; i++) read(a[i]);
        ll ans = 0;
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= i - 2; j++) cnt[a[j] * maxn + a[i - 1]]++;
            for (int j = i + 1; j <= n; j++) {
                ans += cnt[a[i] * maxn + a[j]];

            }
        }
        printf("%lld\n", ans);
    }
    return 0;
}