摘要：The Company Dynamic Rankings has developed a new kind of computer that is no longer satisfied with the query like to simply find the k-th smallest num 阅读全文

摘要：//求第K的的值 1 #include 2 #include 3 #include 4 #include 5 using namespace std; 6 typedef long long LL; 7 const int maxn = 1e5 + 10; 8 int n, m, cnt; 9 struct node { 10 int L, R, sum; 11 } tr... 阅读全文

摘要：Minimum Sum Time Limit: 16000/8000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4611 Accepted Submission(s): 1046 Pr 阅读全文

摘要：Problem Description Mario is world-famous plumber. His “burly” figure and amazing jumping ability reminded in our memory. Now the poor princess is in 阅读全文

摘要：Description You are working for Macrohard company in data structures department. After failing your previous task about key insertion you were asked t 阅读全文