C++博客-LSM ACM/ICPC算法程序设计空间-最新评论http://www.cppblog.com/shiming413/CommentsRSS.aspxalpc02 at pojzh-cnMon, 17 Sep 2007 12:16:55 GMTMon, 17 Sep 2007 12:16:55 GMTcnblogsre: marker切奇数题，我切偶数题http://www.cppblog.com/shiming413/archive/2008/01/02/32364.html#40263秦歌秦歌Wed, 02 Jan 2008 12:15:00 GMThttp://www.cppblog.com/shiming413/archive/2008/01/02/32364.html#40263

秦歌 2008-01-02 20:15 发表评论
]]>re: POJ 3351 —— Gerrymanderinghttp://www.cppblog.com/shiming413/archive/2007/12/21/30577.html#39168smcdfnegsmcdfnegThu, 20 Dec 2007 16:19:00 GMThttp://www.cppblog.com/shiming413/archive/2007/12/21/30577.html#391685
3 5 6 7 9
4 1 1 5 5
2 5 3 3 8
2 4 2 2 1
9 3 2 5 5
4
这个数据是有错的吧！

smcdfneg 2007-12-21 00:19 发表评论
]]>re: POJ 3351 —— Gerrymanderinghttp://www.cppblog.com/shiming413/archive/2007/12/07/30577.html#37985CtasCtasFri, 07 Dec 2007 06:19:00 GMThttp://www.cppblog.com/shiming413/archive/2007/12/07/30577.html#37985PKU上好像是求参加合并的选区数最少值，“gives the minimum number of ridings that need to be merged in order for the first party to win a majority of ridings.”
按照作者写的，“dp[k][t]代表前k个riding合并成t块（也就是说合并k-t次），目标则是max(t)”，好像是求合并次数最少值？？？

Ctas 2007-12-07 14:19 发表评论
]]>re: marker切奇数题，我切偶数题http://www.cppblog.com/shiming413/archive/2007/12/06/32364.html#37924alpc55alpc55Thu, 06 Dec 2007 13:20:00 GMThttp://www.cppblog.com/shiming413/archive/2007/12/06/32364.html#37924

alpc55 2007-12-06 21:20 发表评论
]]>re: marker切奇数题，我切偶数题http://www.cppblog.com/shiming413/archive/2007/11/21/32364.html#370980202Wed, 21 Nov 2007 10:33:00 GMThttp://www.cppblog.com/shiming413/archive/2007/11/21/32364.html#37098我很少来这哈

02 2007-11-21 18:33 发表评论
]]>