[ch 4201] 楼兰图腾｛树状数组（逆序对）｝

题目

http://contest-hunter.org:83/contest/0x40%E3%80%8C%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E8%BF%9B%E9%98%B6%E3%80%8D%E4%BE%8B%E9%A2%98/4201%20%E6%A5%BC%E5%85%B0%E5%9B%BE%E8%85%BE

---

解题思路

本题实际求的是逆序对，树状数组维护的是小于 x x <script type="math/tex" id="MathJax-Element-17">x</script>的个数。然后累求图腾的个数。

---

代码

#include<cstdio>
using namespace std; 
long long ans1,ans2; int n,x; long long a[200011]; 
int answer(int x)
{int ans=0; for(;x;x-=x&-x) ans+=a[x]; return ans;}
void add(int x,int y) {for(;x<=n;x+=x&-x) a[x]+=y;}
int main()
{
    scanf("%d",&n); 
    for (int i=1;i<=n;i++)
    {
        scanf("%d",&x); long long k=answer(x-1); 
        ans1+=(long long)((i-k-1)*(n-i-x+1+k)); 
        ans2+=(long long)(k*(x-1-k));
        add(x,1);
    }
    printf("%lld %lld",ans1,ans2);
}