题目链接:https://www.luogu.com.cn/problem/P1908
思路
树状数组记录n的个数,进来一个edit一次,就可以记录前面的啦~!
代码
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define ll long long
#define int long long
using namespace std;
const int INF = 0x3f3f3f3f;
int a[500010],b[500010],s[500010];
int n,m;
int val(int x){
return lower_bound(a+1,a+1+m,x)-a;
}
int lowbit(int x){
return x&(-x);
}
void edit(int pos,int val){
for(int i=pos;i<=m;i+=lowbit(i)){
b[i]+=val;
}
}
int query(int pos){
int res=0;
for(int i=pos;i>=1;i-=lowbit(i)){
res+=b[i];
}
return res;
}
signed main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
s[i]=a[i];
}
sort(a+1,a+1+n);
m=unique(a+1,a+1+n)-a-1;
int ans=0;
for(int i=1;i<=n;i++){
int t=val(s[i]);
edit(t,1);
ans+=i-query(t);
}
cout<<ans<<endl;
return 0;
}