2013年11月22日
摘要: http://poj.org/problem?id=3159题意:flymouse是幼稚园班上的班长,一天老师给小朋友们买了一堆的糖果,由flymouse来分发,在班上,flymouse和snoopy是死对头,两人势如水火,不能相容,因此fly希望自己分得的糖果数尽量多于snoopy,而对于其他小朋友而言,则只希望自己得到的糖果不少于班上某某其他人就行了。比如A小朋友强烈希望自己的糖果数不能少于B小朋友m个,即B- A 2 #include 3 #include 4 using namespace std; 5 6 const int INF = 0x3f3f3f3f; 7 const in. 阅读全文
posted @ 2013-11-22 22:01 straw_berry 阅读(329) 评论(0) 推荐(0) 编辑
摘要: 题目描述 Long long ago, There was a country named X, the country has N citieswhich are numbered from 1 to N. The king of Country-X wants to construct some roads. Please note that Country-X is blessed by an angel. He(The angel is a boy? This is no science, but do not care about those details, this ange.. 阅读全文
posted @ 2013-11-22 18:55 straw_berry 阅读(201) 评论(0) 推荐(0) 编辑