#pragma GCC optimize ("O3") #pragma GCC target ("avx") // yukicoder // #pragma GCC target ("sse4") // SPOJ, codechef #include #include #include #include #include #include #include #include #include #include #include #include #define _rep(_1, _2, _3, _4, name, ...) name #define rep2(i, n) rep3(i, 0, n) #define rep3(i, a, b) rep4(i, a, b, 1) #define rep4(i, a, b, c) for (int i = int(a); i < int(b); i += int(c)) #define rep(...) _rep(__VA_ARGS__, rep4, rep3, rep2, _)(__VA_ARGS__) using namespace std; using i8 = signed char; using i64 = long long; using u8 = unsigned char; using u32 = unsigned; using u64 = unsigned long long; using f80 = long double; #define getchar getchar_unlocked int get_int() { int n, c, sign = 0; while ((c = getchar()) < '-'); if (c == '-') sign = 1, n = 0; else n = c - '0'; while ((c = getchar()) >= '0') n = n * 10 + c - '0'; return sign ? -n : n; } i64 A[1000010]; i64 fenwick[1000010]; inline void add(int N, int n, int v) { n += 1; while (n <= N) { fenwick[n] += v; n += n & -n; } } inline i64 sum(int, int n) { i64 ret = 0; n += 1; while (n) { ret += fenwick[n]; n &= n - 1; } return ret; } void solve() { int N; while (~scanf("%d", &N)) { rep(i, N) A[i] = i64(get_int()) << 32 | i; sort(A, A + N); fill(fenwick, fenwick + N + 1, 0); int c = 0, prev_v = 0, prev_j = 0; i64 cumu = 0, ans = 0; rep(i, N) { int j = A[i], v = A[i] >> 32; if (v == prev_v) { ++c; } else { c = 0, cumu = 0; } int left = sum(N, j), right = i - left; ans += i64(j - left) * (N - 1 - j - right); ans += i64(left - c) * right; if (v == prev_v) cumu += i64(c) * (j - prev_j - 1); ans -= cumu; cumu += j - left; add(N, j, 1); prev_j = j, prev_v = v; } printf("%lld\n", ans); } } int main() { clock_t beg = clock(); solve(); clock_t end = clock(); fprintf(stderr, "%.3f sec\n", double(end - beg) / CLOCKS_PER_SEC); return 0; }