【Leetcode】2475. Number of Unequal Triplets in Array

题目地址：

https://leetcode.com/problems/number-of-unequal-triplets-in-array/

给定一个长$n$数组$A$，求其所有三元组$(i,j,k)$使得$i<j<k\wedge A[i]\ne A[j]\wedge A[i]\ne A[k]\wedge A[j]\ne A[k]$。题目保证$1\le A[i]\le 1000$。

先求出数组$c$使得 c [ i ] = ∣ { k ∣ A [ k ] = i } ∣ c[i]=|\{k|A[k]=i\}| c[i]=∣{k∣A[k]=i}∣，这样问题转化为求$$\sum _{i<j<k}c[i]c[j]c[k]$$即求：$$\sum _{k\ge 2}c[k]\sum _{i<j<k}c[i]c[j]=\sum _{k\ge 2}c[k]\sum _{j\le k}c[j]\sum _{i<j}c[i]$$所以可以按步骤求解，先求$\forall j,{\sum }_{i<j}c[i]$，此即为前缀和；求完之后再求$\forall j,d[j]=c[j]{\sum }_{i<j}c[i]$，然后再求$d[j]$的前缀和，此即为$\forall k,{\sum }_{j\le k}c[j]{\sum }_{i<j}c[i]$，再求$\forall k,e[k]=c[k]{\sum }_{j\le k}c[j]{\sum }_{i<j}c[i]$，再求$e$的总和，即为答案。代码如下：

class Solution {
public:
  const int N = 1000;
  int unequalTriplets(vector<int> &a) {
    vector<int> cnt(N + 1);
    for (int x : a) cnt[x]++;
    a = cnt;
    auto f = [&]() { 
      for (int i = 1; i <= N; i++) cnt[i] += cnt[i - 1];
      for (int i = N; i >= 1; i--) cnt[i] = a[i] * cnt[i - 1];
    };
    f(); f();
    int res = 0;
    for (int i = 1; i <= N; i++) res += cnt[i];
    return res;
  }
};

时间复杂度$O(n)$，空间$O(1)$（这里视$1000$为普通常数）。