首页 > 代码库 > CF #261 div2 D. Pashmak and Parmida's problem （树状数组版）

CF #261 div2 D. Pashmak and Parmida's problem （树状数组版）

2024-10-03 15:02:39   215人阅读

Parmida is a clever girl and she wants to participate in Olympiads this year. Of course she wants her partner to be clever too (although he‘s not)! Parmida has prepared the following test problem for Pashmak.

There is a sequence a that consists of n integers a1,?a2,?...,?an. Let‘s denote f(l,?r,?x) the number of indicesk such that: l?≤?k?≤?r andak?=?x. His task is to calculate the number of pairs of indiciesi,?j (1?≤?i?<?j?≤?n) such thatf(1,?i,?ai)?>?f(j,?n,?aj).

Help Pashmak with the test.

Input

The first line of the input contains an integer n(1?≤?n?≤?106). The second line containsn space-separated integers a1,?a2,?...,?an(1?≤?ai?≤?109).

Output

Print a single integer — the answer to the problem.

Sample test(s)
Input
71 2 1 1 2 2 1
Output
8
Input
31 1 1
Output
1
Input
51 2 3 4 5
Output
0



树状数组写起来更方便。


#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <set>
#include <stack>
#include <cctype>
#include <algorithm>
#define lson o<<1, l, m
#define rson o<<1|1, m+1, r
using namespace std;
typedef long long LL;
const int mod = 99999997;
const int MAX = 0x3f3f3f3f;
const int maxn = 1000010;
int n, a, b;
int in[maxn], f[maxn], vis[maxn], l[maxn], r[maxn], tt[maxn];
int c[maxn];
int bs(int v, int x, int y) {
    while(x < y) {
        int m = (x+y) >> 1;
        if(in[m] >= v) y = m;
        else x = m+1;
    }
    return x;
}
int main()
{
    cin >> n;
    for(int i = 0; i < n; i++) {
        scanf("%d", &in[i]);
        tt[i] = in[i];
    }
    sort(in, in+n);
    int m = unique(in, in+n) - in;
    for(int i = 0; i < n; i++) {
        f[i] = bs(tt[i], 0, m-1) + 1;
        vis[ f[i] ]++;
        l[i+1] = vis[ f[i] ];
    }
    memset(vis, 0, sizeof(vis));
    for(int i = n-1; i >= 0; i--) {
        f[i] = bs(tt[i], 0, m-1) + 1;
        vis[ f[i] ]++;
        r[i+1] = vis[ f[i] ];
    }
    LL sum = 0;
    for(int i = 1; i <= n; i++) {
        for(int j = r[i]+1; j <= maxn; j += j&-j) sum += c[j];
        for(int j = l[i]; j > 0; j -= j&-j) c[j]++;
    }
    cout << sum << endl;
    return 0;
}




CF #261 div2 D. Pashmak and Parmida&#39;s problem （树状数组版）


联系
我们