61E - Enemy is weak （树状数组）

最新推荐文章于 2021-08-04 11:05:47 发布

原创最新推荐文章于 2021-08-04 11:05:47 发布 · 514 阅读

0 ·

CC 4.0 BY-SA版权

本文为博主原创文章，未经博主允许也可以转载。

暑期集训刷题算法复习（新手）同时被 2 个专栏收录

123 篇文章

订阅专栏

树状数组

16 篇文章

订阅专栏

本文介绍了一种算法，用于计算罗马军队中的弱点数量。弱点被定义为三个人员的位置与实力成反比的情况。通过使用离线处理和树状数组来高效地找到每个士兵前后的相对实力情况。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

E. Enemy is weak

time limit per test

5 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

The Romans have attacked again. This time they are much more than the Persians but Shapur is ready to defeat them. He says: "A lion is never afraid of a hundred sheep".

Nevertheless Shapur has to find weaknesses in the Roman army to defeat them. So he gives the army a weakness number.

In Shapur's opinion the weakness of an army is equal to the number of triplets i, j, k such that i < j < k and a_i > a_j > a_k where a_x is the power of man standing at position x. The Roman army has one special trait — powers of all the people in it are distinct.

Help Shapur find out how weak the Romans are.

Input

The first line of input contains a single number n (3 ≤ n ≤ 10⁶) — the number of men in Roman army. Next line contains n different positive integers a_i (1 ≤ i ≤ n, 1 ≤ a_i ≤ 10⁹) — powers of men in the Roman army.

Output

A single integer number, the weakness of the Roman army.

Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preffered to use cout (also you may use %I64d).

Examples

Input

3
3 2 1

Output

Input

3
2 3 1

Output

Input

4
10 8 3 1

Output

Input

4
1 5 4 3

Output

求数据中三个位置与大小相反的数有几对

求一个数前面比他大的数的数量乘一个数后面比他小的数的数量即为结果。

以前没怎么写过E题。。这应该是E题中为数不多的简单题吧

#include <bits/stdc++.h>
using namespace std;
const int AX = 1e6+666;
struct Node{
	int pos;
	int val;
}node[AX];
int formerBiger[AX];
int laterSmaller[AX];
int flect[AX];
int c[AX];
	int n;
bool cmp(Node a,Node b){
	return a.val<b.val;
}
int lowbit(int x){
	return x&(-x);
}
void update(int value,int site){
	while(site<=n){
		c[site] += value;
		site += lowbit(site);
	}
}
int getsum(int i){
	int sum = 0;
	while(i>=1){
		sum += c[i];
		i -= lowbit(i);
	}
	return sum;
}
int main(){
	while(cin>>n){
	if(n==0) break;
	long long ans = 0;
	memset(node,0,sizeof(node));
	memset(flect,0,sizeof(flect));
	memset(c,0,sizeof(c));
	for(int i=1;i<=n;i++){
		cin>>node[i].val;
		node[i].pos = i;
	}
	sort(node+1,node+n+1,cmp);
	for(int i=1;i<=n;i++){
		flect[node[i].pos] = i;
	}
	for(int i=1;i<=n;i++){
		update(1,flect[i]);
		formerBiger[i] = i-getsum(flect[i]);     //一个数前面比他大的数
	}
	memset(c,0,sizeof(c));
	for(int i=n;i>=1;i--){	
		update(1,flect[i]);
		laterSmaller[i] = getsum(flect[i])-1;    //一个数后面比他小的数的数量
	}
	
	for(int i=1;i<=n;i++){
		ans += (long long)formerBiger[i]*laterSmaller[i];  //这里强制转化一下long long，或者数组就设									//置为long long，不然会WA。
	}
	cout<<ans<<endl;
	}
	return 0;
}