摘要：
50 years, 50 colors Problem Description On Octorber 21st, HDU 50-year-celebration, 50-color balloons floating around the campus, it's so nice, isn't i 阅读全文
摘要：
Air Raid Problem Description Consider a town where all the streets are one-way and each street leads from one intersection to another. It is also know 阅读全文
摘要：
Machine Schedule Problem Description As we all know, machine scheduling is a very classical problem in computer science and has been studied for a ver 阅读全文
摘要：
Girls and Boys Problem Description the second year of the university somebody started a study on the romantic relations between the students. The rela 阅读全文
摘要：
二分匹配总结 首先讲一下什么是二分图，在一个图中，以边为条件，能将两个端点划分为两个集合的图叫做二分图，如下图： 左图为二分图，右图为简化后的二分图。 接着就是二分图的匹配问题，二分图的匹配就是找一个边的集合，每条边的的顶点的度数为1。 如上图所示，匹配到四条边。 二分图的完美匹配，就是所有的顶点都 阅读全文
摘要：
C. Tram time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output The tram in Berland goes along a 阅读全文