2013年10月29日
CodeForces 148D. Bag of mice
摘要： D. Bag of micetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe dragon and the princess are arguing about what to do on the New Year's Eve. The dragon suggests flying to the mountains to watch fairies dancing in the moonlight, while the pri 阅读全文
posted @ 2013-10-29 20:34 码代码的猿猿 阅读(166) 评论(0) 推荐(0) 编辑
POJ 3071 Football
摘要： 很久以前就见过的。。。最基本的概率DP。。。除法配合位运算可以很容易的判断下一场要和谁比。 from——Dinic算法 FootballTime Limit:1000MSMemory Limit:65536KTotal Submissions:2499Accepted:1258DescriptionConsider a single-elimination football tournament involving 2nteams, denoted 1, 2, …, 2n. In each round of the tournament, all teams still... 阅读全文
posted @ 2013-10-29 14:57 码代码的猿猿 阅读(221) 评论(0) 推荐(0) 编辑
POJ 3744 Scout YYF I
摘要： 分段的概率DP+矩阵快速幂 Scout YYF ITime Limit:1000MSMemory Limit:65536KTotal Submissions:4180Accepted:1076DescriptionYYF is a couragous scout. Now he is on a dangerous mission which is to penetrate into the enemy's base. After overcoming a series difficulties, YYF is now at the start of enemy's famo.. 阅读全文
posted @ 2013-10-29 09:17 码代码的猿猿 阅读(255) 评论(0) 推荐(0) 编辑