摘要：
Tree RecoveryTime Limit:1000MSMemory Limit:65536KTotal Submissions:9710Accepted:6105DescriptionLittle Valentine liked playing with binary trees very much. Her favorite game was constructing randomly looking binary trees with capital letters in t... 阅读全文
摘要：
棋盘游戏Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1650Accepted Submission(s): 947Problem Description小希和Gardon在玩一个游戏：对一个N*M的棋盘，在格子里放尽量多的一些国际象棋里面的“车”，并且使得他们不能互相攻击，这当然很简单，但是Gardon限制了只有某些格子才可以放，小希还是很轻松的解决了这个问题（见下图）注意不能放车的地方不影响车的互相... 阅读全文
摘要：
The Perfect StallTime Limit:1000MSMemory Limit:10000KTotal Submissions:16254Accepted:7433DescriptionFarmer John completed his new barn just last week, complete with all the latest milking technology. Unfortunately, due to engineering problems, all the stall... 阅读全文
摘要：
Machine ScheduleTime Limit:2 Seconds Memory Limit:65536 KBAs 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 the constraints that must be satisfied and the type of schedul 阅读全文
摘要：
Girls and BoysTime Limit:10 Seconds Memory Limit:32768 KBthe second year of the university somebody started a study on the romantic relations between the students. The relation ��romantically involved�� is defined between one girl and one boy. For the study reasons it is necessary to find out the ma 阅读全文
摘要：
AsteroidsTime Limit:1000MSMemory Limit:65536KTotal Submissions:12270Accepted:6679DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 using namespace std; const int N = 510; //定... 阅读全文
摘要：
Schedule ProblemTime Limit:2 Seconds Memory Limit:65536 KB Special JudgeA project can be divided into several parts. Each part should be completed continuously. This means if a part should take 3 days, we should use a continuous 3 days do complete it. There are four types of constrains among these p 阅读全文