解:树状数组,先对数组顺序遍历一遍,记录每个元素左边分别有多少个大于它的元素和小于它的元素。再逆序遍历一遍,记录每个元素右边分别有多少个大于它的元素和小于它的元素。累加每个元素的二者乘积即可。
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i = a;i<n;i++)
#define per(i,a,n) for(int i = n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define yes cout<<"YES"<<'\n';
#define no cout<<"NO"<<'\n';
#define endl '\n';
typedef vector<int> VI;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll MOD=1000000007;
int rnd(int x) {return mrand() % x;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;};
ll lcm(int a,int b){return a*b/gcd(a,b);};
const int N=200010;
int n;
int a[N],tr[N];
int g[N],l[N];
int lowbit(int x){
return x&-x;
}
void add(int x,int k){
for(int i=x;i<=n;i+=lowbit(i)){
tr[i]+=k;
}
}
int query(int x){
int ans=0;
for(int i=x;i;i-=lowbit(i)){
ans+=tr[i];
}
return ans;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n;
rep(i,1,n+1) cin>>a[i];
rep(i,1,n+1){
int y=a[i];
g[i]=query(n)-query(y);
l[i]=query(y-1);
add(y,1);
}
memset(tr,0,sizeof tr);
ll r1=0,r2=0;
per(i,1,n+1){
int y=a[i];
r1+=g[i]*1LL*(query(n)-query(y));
r2+=l[i]*1LL*query(y-1);
add(y,1);
}
cout<<r1<<" "<<r2<<endl;
return 0;
}
时间复杂度:O(nlogn)。
空间复杂度:O(n)。