果冻0_0

摘要： DescriptionVanya walks late at night along a straight street of lengthl, lit bynlanterns. Consider the coordinate system with the beginning of the str... 阅读全文

摘要： Descriptionbobo has a sequence a1,a2,…,an. He is allowed to swap twoadjacentnumbers for no more than k times.Find the minimum number of inversions aft... 阅读全文

摘要： HDU 1969 Pie（二分法）My birthday is coming up and traditionally I’m serving pie. Not just one pie, no, I have a number N of them, of various tastes and of... 阅读全文

摘要： DescriptionBefore the invention of book-printing, it was very hard to make a copy of a book. All the contents had to be re-written by hand by so calle... 阅读全文

摘要： DescriptionExamine thecheckerboard below and note that the six checkers are arranged on the board so that one and only one is placed in each row and e... 阅读全文

摘要： In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacen... 阅读全文

摘要： DescriptionThere is a piece of paper in front of Tom, its length and width are integer. Tom knows the area of this paper, he wants to know the minimum... 阅读全文

摘要： DescriptionAndrewid the Android is a galaxy-famous detective. In his free time he likes to think about strings containing zeros and ones.Once he thoug... 阅读全文

摘要： DescriptionA ring is composed of n (even number) circles as shown in diagram. Put natural numbersinto each circle separately, and the sum of numbers i... 阅读全文

摘要： Given a sequence of integers S = {S1, S2, . . . , Sn}, you should determine what is the value of themaximum positive product involving consecutive ter... 阅读全文