摘要：
class Solution { public: int result = 0; int InversePairs(vector<int> data) { int len = data.size(); vector<int> temp(len); MergeSort(data, temp, 0, l 阅读全文
posted @ 2020-10-12 21:34
DeaL57
阅读(149)
评论(0)
推荐(0)
摘要：
There is a tree with NN vertices numbered 11 through NN. The ii-th of the N−1N−1 edges connects vertices aiai and bibi. Initially, each vertex is unco 阅读全文
posted @ 2020-10-08 12:19
DeaL57
阅读(174)
评论(0)
推荐(0)
摘要：
P2014 [CTSC1997]选课 #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #includ 阅读全文
posted @ 2020-09-23 15:42
DeaL57
阅读(273)
评论(0)
推荐(0)
摘要：
樱花 #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #include <sstream> #inc 阅读全文
posted @ 2020-09-16 20:53
DeaL57
阅读(119)
评论(0)
推荐(0)
摘要：
#include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #include <sstream> #includ 阅读全文
posted @ 2020-09-11 11:11
DeaL57
阅读(146)
评论(0)
推荐(0)
摘要：
PE给我整吐了 #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #include <sstream> 阅读全文
posted @ 2020-09-01 17:42
DeaL57
阅读(167)
评论(0)
推荐(0)
摘要：
#include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #include <sstream> #includ 阅读全文
posted @ 2020-09-01 16:18
DeaL57
阅读(181)
评论(0)
推荐(0)
摘要：
#include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #include <sstream> #includ 阅读全文
posted @ 2020-09-01 15:25
DeaL57
阅读(131)
评论(0)
推荐(0)
摘要：
#include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #include <sstream> #includ 阅读全文
posted @ 2020-09-01 09:29
DeaL57
阅读(93)
评论(0)
推荐(0)
浙公网安备 33010602011771号