Kaiser- - 博客园

2017年10月16日

摘要： A domino is a flat, thumbsized tile, the face of which is divided into two squares, each left blank or bearing from one to six dots. There is a row of 阅读全文

posted @ 2017-10-16 18:40 Kaiser- 阅读(308) 评论(0) 推荐(0) 编辑

POJ1635 树的最小表示法（判断同构）

摘要： Some major cities have subway systems in the form of a tree, i.e. between any pair of stations, there is one and only one way of going by subway. More 阅读全文

posted @ 2017-10-16 18:36 Kaiser- 阅读(202) 评论(0) 推荐(0) 编辑

2017年10月15日

hdu4336 Card Collector(概率DP,状态压缩)

摘要： In your childhood, do you crazy for collecting the beautiful cards in the snacks? They said that, for example, if you collect all the 108 people in th 阅读全文

posted @ 2017-10-15 20:33 Kaiser- 阅读(140) 评论(0) 推荐(0) 编辑

POJ3071

摘要： Consider a single-elimination football tournament involving 2n teams, denoted 1, 2, …, 2n. In each round of the tournament, all teams still in the tou 阅读全文

posted @ 2017-10-15 20:19 Kaiser- 阅读(260) 评论(0) 推荐(0) 编辑

POJ2151:Check the difficulty of problems(概率DP)

摘要： Organizing a programming contest is not an easy job. To avoid making the problems too difficult, the organizer usually expect the contest result satis 阅读全文

posted @ 2017-10-15 20:13 Kaiser- 阅读(193) 评论(0) 推荐(0) 编辑

hdu4035 Maze (树上dp求期望)

摘要： dp求期望的题。题意：有n个房间，由n-1条隧道连通起来，实际上就形成了一棵树，从结点1出发，开始走，在每个结点i都有3种可能： 1.被杀死，回到结点1处（概率为ki） 2.找到出口，走出迷宫（概率为ei） 3.和该点相连有m条边，随机走一条求：走出迷宫所要走的边数的期望值。设 E[i]表示在结... 阅读全文

posted @ 2017-10-15 20:07 Kaiser- 阅读(147) 评论(0) 推荐(0) 编辑

HDU4405-Aeroplane chess(概率DP求期望)

摘要： Hzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to N. Hzz starts at grid 0. For each step he throws a dice(a dice 阅读全文

posted @ 2017-10-15 19:57 Kaiser- 阅读(117) 评论(0) 推荐(0) 编辑

hdu3853 LOOPS(概率DP)

摘要： Akemi Homura is a Mahou Shoujo (Puella Magi/Magical Girl). Homura wants to help her friend Madoka save the world. But because of the plot of the Boss 阅读全文

posted @ 2017-10-15 19:53 Kaiser- 阅读(202) 评论(0) 推荐(0) 编辑

POJ3744 Scout YYF I (矩阵优化的概率DP)

摘要： Scout YYF I YYF is a couragous scout. Now he is on a dangerous mission which is to penetrate into the enemy's base. After overcoming a series difficul 阅读全文

posted @ 2017-10-15 19:50 Kaiser- 阅读(175) 评论(0) 推荐(0) 编辑

POJ2096 Collecting Bugs(概率DP,求期望)

摘要： Collecting Bugs Ivan is fond of collecting. Unlike other people who collect post stamps, coins or other material stuff, he collects software bugs. Whe 阅读全文

posted @ 2017-10-15 19:45 Kaiser- 阅读(177) 评论(0) 推荐(0) 编辑

Kaiser

No fear, no regrets！

公告