摘要： 1500 苹果曼和树 1.0 秒 131,072.0 KB 80 分 5级题 1500 苹果曼和树 1.0 秒 131,072.0 KB 80 分 5级题 1500 苹果曼和树 苹果曼有一棵n个点的树。有一些（至少一个）结点被标记为黑色，有一些结点被标记为白色。 现在考虑一个包含k(0 ≤ k < 阅读全文

摘要： 问题 g: 普通平衡树 题目描述 您需要写一种数据结构（可参考题目标题），来维护一些数，其中需要提供以下操作：1.插入x数2.删除x数(若有多个相同的数，因只删除一个)3.查询x数的排名(若有多个相同的数，因输出最小的排名)4.查询排名为x的数5.求x的前驱(前驱定义为小于x，且最大的数)6.求x的 阅读全文

摘要： 12269: First One 题目描述 输入 There are multiple test cases. The first line of input contains an integer T, indicating the number of test cases. For each t 阅读全文

摘要： 12231: Magician 题目描述 Fantasy magicians usually gain their ability through one of three usual methods: possessing it as an innate talent, gaining it th 阅读全文

摘要： GT and set Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 605 Accepted Submission(s): 211 Proble 阅读全文

摘要： Harry And Dig Machine Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1991 Accepted Submission(s) 阅读全文

摘要： Cake Robbery Time Limit: 2000 msMemory Limit: 65536 KB As usual, Alice finishes her delicious cake at noon. Unfortunately, the smell of cake beckoned 阅读全文

摘要： Given a permutation pp of length nn, you are asked to answer mm queries, each query can be represented as a pair (l ,r )(l,r), you need to find the nu 阅读全文

摘要： Recently Kumiko learns to use containers in C++ standard template library. She likes to use the std::vector very much. It is very convenient for her t 阅读全文

摘要： String is a very useful thing and a subsequence of the same string is equally important. Now you have a string ss with length nn and a string tt with 阅读全文