C++博客-zxb-最新评论http://www.cppblog.com/zxb/CommentsRSS.aspxzh-cnFri, 05 Apr 2013 07:30:04 GMTFri, 05 Apr 2013 07:30:04 GMTcnblogsre: poj3167 Cow Patternshttp://www.cppblog.com/zxb/archive/2012/10/29/128782.html#194036zxbzxbMon, 29 Oct 2012 12:36:00 GMThttp://www.cppblog.com/zxb/archive/2012/10/29/128782.html#194036是指字符集的大小，即the number of spots on cow 为1到S

zxb 2012-10-29 20:36 发表评论
]]>re: poj3167 Cow Patternshttp://www.cppblog.com/zxb/archive/2012/10/29/128782.html#194035xuezhongfenfeixuezhongfenfeiMon, 29 Oct 2012 12:31:00 GMThttp://www.cppblog.com/zxb/archive/2012/10/29/128782.html#194035

xuezhongfenfei 2012-10-29 20:31 发表评论
]]>re: hdu2297 Runhttp://www.cppblog.com/zxb/archive/2012/02/02/129739.html#164855zxbzxbThu, 02 Feb 2012 14:31:00 GMThttp://www.cppblog.com/zxb/archive/2012/02/02/129739.html#164855嗯，我确实写错了

zxb 2012-02-02 22:31 发表评论
]]>re: hdu2297 Runhttp://www.cppblog.com/zxb/archive/2012/02/02/129739.html#164853fcjyfcjyThu, 02 Feb 2012 14:11:00 GMThttp://www.cppblog.com/zxb/archive/2012/02/02/129739.html#164853
不过博主的代码貌似有个小漏洞，maxv的初始应该和a[1].v是一样的，不应该是0。
请看这组数据：
2
2 3
1 1
我用你的代码输出2

fcjy 2012-02-02 22:11 发表评论
]]>re: poj3167 Cow Patternshttp://www.cppblog.com/zxb/archive/2011/11/10/128782.html#159936zxbzxbThu, 10 Nov 2011 13:27:00 GMThttp://www.cppblog.com/zxb/archive/2011/11/10/128782.html#159936就是为了简化前面给出的比较条件，降低时间复杂度

zxb 2011-11-10 21:27 发表评论
]]>re: poj3167 Cow Patternshttp://www.cppblog.com/zxb/archive/2011/11/10/128782.html#159902祝你好运祝你好运Thu, 10 Nov 2011 02:14:00 GMThttp://www.cppblog.com/zxb/archive/2011/11/10/128782.html#159902

祝你好运 2011-11-10 10:14 发表评论
]]>re: hdu2481 Toyhttp://www.cppblog.com/zxb/archive/2011/08/29/128522.html#154639xiaoyxiaoyMon, 29 Aug 2011 12:46:00 GMThttp://www.cppblog.com/zxb/archive/2011/08/29/128522.html#154639

xiaoy 2011-08-29 20:46 发表评论
]]>re: hdu2481 Toyhttp://www.cppblog.com/zxb/archive/2011/08/29/128522.html#154637zxbzxbMon, 29 Aug 2011 12:10:00 GMThttp://www.cppblog.com/zxb/archive/2011/08/29/128522.html#154637n个点的生成树的计数问题，先是得到一个n阶矩阵，但它的行列式是0
而那个矩阵中，任意一个n-1阶主子式的值即为生成树的个数

zxb 2011-08-29 20:10 发表评论
]]>re: hdu2481 Toyhttp://www.cppblog.com/zxb/archive/2011/08/29/128522.html#154609xiaoyxiaoyMon, 29 Aug 2011 07:08:00 GMThttp://www.cppblog.com/zxb/archive/2011/08/29/128522.html#154609

xiaoy 2011-08-29 15:08 发表评论
]]>re: hdu2481 Toyhttp://www.cppblog.com/zxb/archive/2011/08/22/128522.html#154087zxbzxbMon, 22 Aug 2011 15:26:00 GMThttp://www.cppblog.com/zxb/archive/2011/08/22/128522.html#154087恩，打错了，你看得真仔细

zxb 2011-08-22 23:26 发表评论
]]>