construct a graph as follows
所在版块：求学狮城 发贴时间：2007-09-07 18:16  评分:

用户信息
复制本帖HTML代码
高亮: 今天贴 X 昨天贴 X 前天贴 X 
vertices: from 0 to n, n+1 vertices, where 0 is outside

edges: weight of edge = number of tunnel connecting the two vertices

perform standard max-flow algorithm

is that right?
.
欢迎来到华新中文网，踊跃发帖是支持我们的最好方法!

This page is intentionally left blank
　相关帖子 我要回复↙ ↗回到正文
anyone interested to discuss about the last question in ACM this year? <Tunnels － chancing 　2007-09-06 09:59 (75 bytes , 1163reads )
这样可以么？ － 房间 　2007-09-20 21:03 (343 bytes , 431reads )
I have revised the solution. － 房间 　2007-10-16 01:15 (737 bytes , 373reads )
似乎还是不行 － bugzzj 　2007-09-21 10:29 (221 bytes , 394reads )
是可以的 － 房间 　2007-09-21 11:32 (1023 bytes , 333reads )
看错了 － 房间 　2007-09-21 11:38 (154 bytes , 341reads )
And － 房间 　2007-09-21 11:40 (88 bytes , 310reads )
顺带询问一个问题 － 房间 　2007-09-20 21:19 (267 bytes , 505reads )
如果child有到parent的ref的话。 － bugzzj 　2007-09-24 14:50 (524 bytes , 454reads )
gr8. － 房间 　2007-10-16 01:02 (142 bytes , 335reads )
construct a graph as follows － icky 　2007-09-07 18:16 (178 bytes , 371reads )
disagree － bugzzj 　2007-09-20 15:35 (149 bytes , 380reads )
so assume the spy enters 2 － icky 　2007-09-24 16:14 (91 bytes , 348reads )
i think we can destroy the tunnels 2 0 and 2 1 simultaneously. － bugzzj 　2007-09-24 17:21 (0 bytes , 350reads )
ok, i misunderstood the problem － icky 　2007-09-25 09:49 (0 bytes , 325reads )
choose one of 3 or 4 － icky 　2007-09-24 16:14 (0 bytes , 312reads )
opps! you are right. － 吴永铮 　2007-09-20 16:25 (76 bytes , 314reads )
agree － 吴永铮 　2007-09-12 15:07 (0 bytes , 276reads )
maxflow from vertex 0 to vertex 1 － icky 　2007-09-07 18:17 (0 bytes , 320reads )
min-cut problem? － icky 　2007-09-06 12:33 (54 bytes , 392reads )