F.A.Qs Home ProblemSet Status Ranklist Contest LoginRegister
大视野在线测评-欢迎您
[ New Thread ]
Problem 2597 >> [Wc2007]剪刀石头布 迭代+matroid intersection
test_tset @ 2014-12-26 09:40:21
[ Quote ] [ Edit ] [ Delete ] 1#
虽然有点慢,但是 总比 拆点+网络流强吧。。。。 308ms....

PS : 迭代算法 太强大了!!!
test_tset @ 2014-12-26 09:41:42
[ Quote ] [ Edit ] [ Delete ] 2#
PS :
貌似 这个方法 还没有优化到位, 估计还有 很深的提高空间。。。
test_tset @ 2014-12-26 09:44:20
[ Quote ] [ Edit ] [ Delete ] 3#
再推荐一道 迭代法的题目:
http://community.topcoder.com/stat?c=problem_statement&pm=12294

4ms 秒杀。。。。
AKCqhzdy @ 2019-01-14 11:58:56
[ Quote ] [ Edit ] [ Delete ] 4#
ORZ求具体做法。。。
AKCqhzdy @ 2019-01-14 12:28:07
[ Quote ] [ Edit ] [ Delete ] 5#
是随机算法吗
test_tset @ 2019-01-14 14:39:34
[ Quote ] [ Edit ] [ Delete ] 6#
先随机化 一组初始解,然后迭代,找一条路径 max-min>=2进行增广路径一直到 找不到为止 复杂度上界 O(m^2) m是 边的个数,但是实际效果来看要比O(m^2)低很多
AKCqhzdy @ 2019-01-14 15:08:30
[ Quote ] [ Edit ] [ Delete ] 7#
ORZ太感谢了神犇RP++
[Top] [Previous Page] [Next Page]

HOME Back