摘要: 巧用队列+树状数组求逆序对 1 #include<bits/stdc++.h> 2 #define ll long long 3 using namespace std; 4 const int N = 2e5 + 10; 5 ll pos[N], t[N]; 6 int n; 7 8 inline 阅读全文
posted @ 2021-01-15 16:48 LegendN 阅读(67) 评论(0) 推荐(0)