求用树状数组求“逆序对”的方法

学术版

@[一只大龙猫](/user/511907) 把原来的查询 1~a[i]-1 的前缀和改成查询 1~a[i] 应该就可以了
by qwq自动机 @ 2021-09-11 11:44:47


@[qwq自动机](/user/134519) 您能更具体地讲一下吗?
by 一只大龙猫 @ 2021-09-11 11:45:39


@[一只大龙猫](/user/511907) [可以看一下这篇博客](https://blog.csdn.net/qq_37321281/article/details/75576228?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522163133186216780357230678%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=163133186216780357230678&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~baidu_landing_v2~default-1-75576228.first_rank_v2_pc_rank_v29&utm_term=%E5%80%BC%E5%9F%9F%E6%A0%91%E7%8A%B6%E6%95%B0%E7%BB%84&spm=1018.2226.3001.4187)
by Sharing666 @ 2021-09-11 11:46:58


@[Sharing666](/user/394991) 这个我会啊,但怎么改啊QAQ
by 一只大龙猫 @ 2021-09-11 11:50:23


```diff - ans+=i-query(b[i]); + ans+=i-query(b[i]-1); ```
by yukimianyan @ 2021-09-11 11:54:51


|