摘要: link Fenwick Tree: class Solution { public: int n; int reversePairs(vector<int>& nums) { n=nums.size(); vector<int> copy=nums; sort(copy.begin(),copy. 阅读全文
posted @ 2020-05-09 17:58 feibilun 阅读(145) 评论(0) 推荐(0)
摘要: link int getint(){ int res=0; char c=getchar(); while(!(c>='0' && c<='9')) c=getchar(); while(c>='0' && c<='9'){ res=res*10+(c-'0'); c=getchar(); } re 阅读全文
posted @ 2020-05-09 08:23 feibilun 阅读(121) 评论(0) 推荐(0)