CodeForces 459D Pashmak and Parmida's problem

最新推荐文章于 2021-10-29 15:25:01 发布

Silenceneo

最新推荐文章于 2021-10-29 15:25:01 发布

阅读量518

点赞数 1

分类专栏： STL 树状数组文章标签： codeforces 树状数组 STL

本文链接：https://blog.csdn.net/Silenceneo/article/details/52133466

版权

STL 同时被 2 个专栏收录

12 篇文章

订阅专栏

树状数组

8 篇文章

订阅专栏

题目链接：http://codeforces.com/problemset/problem/459/D

Pashmak and Parmida's problem

time limit per test ：3 seconds

memory limit per test ：256 megabytes

input ：standard input

output ：standard output

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 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

Print a single integer — the answer to the problem.

Examples

Input

7
1 2 1 1 2 2 1

Output

Input

3
1 1 1

Output

Input

5
1 2 3 4 5

Output

思路：先正着、逆着分别将各个区间的值算出来，然后对于逆着的区间，只有小于其下标的值才会影响答案，因此，对于每个正着的区间，在计算其结果时，大于其下标的必须要被判断计算，这样就很容易想到用树状数组来维护，将正着的区间倒着计算，并将大于其下标的值插入树状数组计数即可。注意：本题数据可能很大，开始计数可以选择用map来实现。详见代码。

附上AC代码：

#include <cstdio>
#include <cstring>
#include <map>
using namespace std;
typedef long long ll;
const int maxn = 1000005;
int num[maxn], a[maxn], b[maxn];
int n;
map<int, int> cnt;

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

void add(int p){
	while (p <= n){
		++num[p];
		p += lowbit(p);
	}
}

ll sum(int p){
	ll ans = 0;
	while (p > 0){
		ans += num[p];
		p -= lowbit(p);
	}
	return ans;
}

int main(){
	while (~scanf("%d", &n)){
		for (int i=1; i<=n; ++i)
			scanf("%d", num+i);
		cnt.clear();
		for (int i=1; i<=n; ++i){
			++cnt[num[i]];
			a[i] = cnt[num[i]];
		}
		cnt.clear();
		for (int i=n; i>=1; --i){
			++cnt[num[i]];
			b[i] = cnt[num[i]];
		}
//		for (int i=1; i<=n; ++i)
//			printf("%d%c", a[i], i!=n ? ' ' : '\n');
//		for (int i=1; i<=n; ++i)
//			printf("%d%c", b[i], i!=n ? ' ' : '\n');
		memset(num, 0, sizeof(num));
		ll ans = 0;
		for (int i=n-1; i>=1; --i){
			add(b[i+1]);
			//printf("%I64d\n", sum(a[i]-1));
			ans += sum(a[i]-1);
		}
		printf("%I64d\n", ans);
	}
	return 0;
}