摘要：
描述 Consider an ordered set S of strings of N (1 <= N <= 31) bits. Bits, of course, are either 0 or 1. This set of strings is interesting because it is 阅读全文
摘要：
描述 In order to celebrate the 8th anniversary of ZOJ, LCLL goes to a sauce factory to "Get Sauce". The factory has N kinds of materials. If we combine 阅读全文
摘要：
描述 You are given a sequence of n integers a1 , a2 , ... , an in non-decreasing order. In addition to that, you are given several queries consisting of 阅读全文
摘要：
描述 For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ul 阅读全文
摘要：
描述 给两个有一定容量的箱子，往里面装宝石（宝石总容量不能超过箱子容量），不同的宝石有不同的容量和价值。求两个箱子里最大宝石的价值。 给两个有一定容量的箱子，往里面装宝石（宝石总容量不能超过箱子容量），不同的宝石有不同的容量和价值。求两个箱子里最大宝石的价值。 输入 line 1: Input n; 阅读全文