![三元逆序对 求i<j<k && a[i]>a[j]>a[k] 的对数 树状数组Codeforces 61E Enemy is weak](/uploads/reation/bcimg1.png)
三元逆序对 求ia[j]>a[k] 的对数 树状数组Codeforces 61E Enemy is weak
http://codeforces.com/problemset/problem/61/EE. Enemy is weaktime limit per test5 secondsmemory limit per test256 megabytesinputstandard inputoutputstan
