刷题记录

Problem DescriptionEvery time it rains on Farmer John’s fields, a pond forms over Bessie’s favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time...

Problem DescriptionOur geometry princess XMM has stoped her study in computational geometry to concentrate on her newly opened factory. Her factory has introduced M new machines in order to process t...

Problem Description给你一个nn的格子的棋盘，每个格子里面有一个非负数。从中取出若干个数，使得任意的两个数所在的格子没有公共边，就是说所取的数所在的2个格子不能相邻，并且取出的数的和最大。Input包括多个测试实例，每个测试实例包括一个整数n 和nn个非负数(n<=20)Output对于每个测试实例，输出可能取得的最大的和Sample Input375 1...

Problem DescriptionAs we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Scheduling problems differ widely in the nature of ...

Problem DescriptionThere is a sequence X (i.e. x[1], x[2], …, x[n]). We define increasing subsequence of Xas x[i1], x[i2],…,x[ik], which satisfies follow conditions:x[i1] < x[i2],…,<x[ik];1...

E. BoxersThere are n boxers, the weight of the i-th boxer is ai. Each of them can change the weight by no more than 1 before the competition (the weight cannot become equal to zero, that is, it must ...