Codeforces 459D Pashmak and Parmida's problem【树状数组】

D. Pashmak and Parmida's problem

time limit per test  3 seconds

memory limit per test      256 megabytes

Parmida is a clever girl and she wants to participate inOlympiads 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 a₁, a₂, ..., a_n. Let's denote f(l, r, x) the number of indices k such that: l ≤ k ≤ r and a_k = x. His task is to calculate the number of pairs of indicies i, j (1 ≤ i < j ≤ n) such that f(1, i, a_i) > f(j, n, a_j).

Help Pashmak with the test.

Input

The first line of the input contains an integer n (1 ≤ n ≤ 10⁶). The second line contains n space-separated integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹).

Output

Printa single integer — the answer to the problem.

Examples

Input

7
1 2 1 1 2 2 1

Output

8

Input

3
1 1 1

Output

1

Input

5
1 2 3 4 5

Output

0

 

【题意】给出n个数，a1~an,定义f(l,r,x)为在范围[l,r]中ai等于x的个数。要求算出有多少对(i,j)(1<=i<j<=n)满足 f(1, i, ai) > f(j, n, aj)。

【分析】显然我们需要得到每一个点的f(1,i,ai)值(前缀个数)以及f(j,n,aj)值(后缀个数)，具体方法便是用一个map容器保存到当前点为止每一个数出现了几次，然后每次用pre数组保存当前的前缀个数，求后缀个数只要从最后一个元素往前扫即可。

对于最终结果我们只要从开头开始扫，得到当前点i后面有多少点j 满足pre[i]>back[j],累加即可，由于数据量较大，这个操作利用线段树实现。

【注意】最终结果会爆int,故应使用long long类型。

#include <cstdio>
#include <map>
#include <iostream>
#include <queue>
#include <cstring>
#include <algorithm>
using namespace std;
#define mst(a,b) memset((a),(b),sizeof(a))
#define rush() int T;scanf("%d",&T);while(T--)

typedef long long ll;
const int maxn= 1000005;
const int mod = 20090717;
const int INF = 0x3f3f3f3f;
const double eps = 1e-6;

int a[maxn];
map<int,int>mp;
int pre[maxn];
int back[maxn];
int tree[maxn];

int lowbit(int x)
{
    return x&(-x);
}

void update(int pos,int val)
{
    while(pos<maxn)
    {
        tree[pos]+=val;
        pos+=lowbit(pos);
    }
}

int query(int pos)
{
    int ans=0;
    while(pos>0)
    {
        ans+=tree[pos];
        pos-=lowbit(pos);
    }
    return ans;
}

int main()
{
    int n;
    mst(tree,0);
    scanf("%d",&n);
    mp.clear();
    for(int i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
        mp[a[i]]++;
        pre[i]=mp[a[i]];
    }
    mp.clear();
    for(int i=n-1;i>=0;i--)
    {
        mp[a[i]]++;
        back[i]=mp[a[i]];
    }
    for(int i=0;i<n;i++)
    {
        update(back[i],1);
    }
    ll ans=0;
    for(int i=0;i<n;i++)
    {
        update(back[i],-1);   //每次查询的必须是当前点后面的元素，故应该减去
        ans+=query(pre[i]-1); 
    }
    printf("%I64d\n",ans);
    return 0;
}