http://acm.hit.edu.cn/hoj/problem/view?id=2275
这题是树状数组的简单应用,树状数组果然是一个优秀的数据结构。
#include<iostream>
#include <stdio.h>
#include<string.h>
#define maxn 50005
using namespace std;
const int m=32771;
int n;
int a[maxn],c[maxn],l[maxn];
int lowbit(int x){
return x&(-x);
}
void add(int x){
while(x < m){
c[x]++;
x += lowbit(x);
}
}
int sum(int x){
int ans = 0;
while(x > 0){
ans += c[x];
x -= lowbit(x);
}
return ans;
}
int main(){
int i;
while(~scanf("%d",&n)){
longlong ans = 0;
memset(c,0,sizeof(c));
for(i =1;i <=n;i++){
scanf("%d",&a[i]);
a[i]++;//树状数组是从1开始的,WA了好多次,下次要更注重细节啊
l[i] = sum(a[i] - 1);
add(a[i]);
}
memset(c,0,sizeof(c));
for(i =n ;i >0;i--){
ans +=sum(a[i] - 1)*l[i];
add(a[i]);
}
printf("%lld\n",ans);
}
return 0;
}