逆序数
guojiaqi007
这个作者很懒,什么都没留下…
展开
-
pat-top 1009. Triple Inversions (35)
https://www.patest.cn/contests/pat-t-practise/1009这道题首先用了一个简单的dp:const int maxn = 1e5 + 2;int lar[maxn];int a[maxn];int main(){ int n, k, ans = 0; scanf("%d", &n); for (int i = 0; i <转载 2017-03-03 09:36:03 · 293 阅读 · 0 评论 -
pat-top 1010. Lehmer Code (35)
https://www.patest.cn/contests/pat-t-practise/1010离散化+树状数组code from http://blog.csdn.net/jtjy568805874/article/details/50898105#include #include using namespace std;const int max转载 2017-03-03 11:48:06 · 288 阅读 · 0 评论