拓扑排序
GAUSS_CLB
acm模板分享:https://github.com/gauss-clb/acm-algorithm-template
展开
-
poj 1094 Sorting It All Out
Sorting It All OutTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 27962 Accepted: 9666DescriptionAn ascending sorted sequence of distinct values is on原创 2014-08-30 20:31:24 · 447 阅读 · 0 评论 -
poj 2585 Window Pains
Window PainsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1601 Accepted: 800DescriptionBoudreaux likes to multitask, especially when it comes to usi原创 2014-08-30 22:29:56 · 698 阅读 · 0 评论 -
poj 1128 Frame Stacking
Frame StackingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4133 Accepted: 1388DescriptionConsider the following 5 picture frames placed on an 9 x 8原创 2014-08-31 15:23:43 · 650 阅读 · 0 评论 -
poj 1270 Following Orders
Following OrdersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3834 Accepted: 1520DescriptionOrder is an important concept in mathematics and in comp原创 2014-08-31 17:07:24 · 498 阅读 · 0 评论 -
poj 3687 Labeling Balls
Labeling BallsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11058 Accepted: 3158DescriptionWindy has N balls of distinct weights from 1 unit to N un原创 2014-08-31 19:28:05 · 506 阅读 · 0 评论 -
逆拓扑+dp
背景随着新版百度空间的上线,Blog宠物绿豆蛙完成了它的使命,去寻找它新的归宿。描述给出一个有向无环图,起点为1终点为N,每条边都有一个长度,并且从起点出发能够到达所有的点,所有的点也都能够到达终点。绿豆蛙从起点出发,走向终点。到达每一个顶点时,如果有K条离开该点的道路,绿豆蛙可以选择任意一条道路离开该点,并且走向每条路的概率为 1/K 。现在绿豆蛙想知道,从起点走原创 2015-04-18 13:29:04 · 547 阅读 · 0 评论