摘要:
class Solution { public: int result = 0; int InversePairs(vector<int> data) { int len = data.size(); vector<int> temp(len); MergeSort(data, temp, 0, l 阅读全文
摘要:
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 阅读全文
摘要:
P2014 [CTSC1997]选课 #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #includ 阅读全文
摘要:
樱花 #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #include <sstream> #inc 阅读全文
摘要:
#include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #include <sstream> #includ 阅读全文
摘要:
PE给我整吐了 #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #include <sstream> 阅读全文
摘要:
#include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #include <sstream> #includ 阅读全文
摘要:
#include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #include <sstream> #includ 阅读全文
摘要:
#include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #include <sstream> #includ 阅读全文