摘要： Description A musical melody is represented as a sequence of N (1<=N<=20000)notes that are integers in the range 1..88, each representing a key on the 阅读全文

摘要： 哈利波特在魔法学校的必修课之一就是学习魔咒。据说魔法世界有100000种不同的魔咒，哈利很难全部记住，但是为了对抗强敌，他必须在危急时刻能够调用任何一个需要的魔咒，所以他需要你的帮助。 给你一部魔咒词典。当哈利听到一个魔咒时，你的程序必须告诉他那个魔咒的功能；当哈利需要某个功能但不知道该用什么魔咒时 阅读全文

摘要： Description John is the only priest in his town. September 1st is the John's busiest day in a year because there is an old legend in the town that the 阅读全文

摘要： 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 阅读全文

摘要： Description Advanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery, other for furniture, or for bri 阅读全文

摘要： Description Alice and Bob are in their class doing drills on multiplication and division. They quickly get bored and instead decide to play a game the 阅读全文