C++博客-y @ The Angry Teletubbies-最新评论http://www.cppblog.com/y346491470/CommentsRSS.aspx为梦想而奋斗！zh-cnMon, 24 Feb 2020 03:17:22 GMTMon, 24 Feb 2020 03:17:22 GMTcnblogsre: poj 3592 Instantaneous Transference - 强连通缩点 + 最长路http://www.cppblog.com/y346491470/archive/2013/08/01/153681.html#202268yoboboboyoboboboWed, 31 Jul 2013 16:21:00 GMThttp://www.cppblog.com/y346491470/archive/2013/08/01/153681.html#202268

yobobobo 2013-08-01 00:21 发表评论
]]>re: poj 1011/uva 307 Sticks - dfs回溯 + 剪枝http://www.cppblog.com/y346491470/archive/2013/07/10/155318.html#201674scau_Josephscau_JosephWed, 10 Jul 2013 09:56:00 GMThttp://www.cppblog.com/y346491470/archive/2013/07/10/155318.html#201674

scau_Joseph 2013-07-10 17:56 发表评论
]]>re: UESTC 1649 D hours - dp + 巧妙转换[未登录]http://www.cppblog.com/y346491470/archive/2013/04/29/174062.html#199831菜鸟菜鸟Mon, 29 Apr 2013 06:24:00 GMThttp://www.cppblog.com/y346491470/archive/2013/04/29/174062.html#199831谢谢！

菜鸟 2013-04-29 14:24 发表评论
]]>re: poj 1743 Musical Theme - 求不可重叠最长重复子串 + height数组分组 + 二分http://www.cppblog.com/y346491470/archive/2012/10/08/174840.html#193019RookieRookieMon, 08 Oct 2012 11:05:00 GMThttp://www.cppblog.com/y346491470/archive/2012/10/08/174840.html#193019

Rookie 2012-10-08 19:05 发表评论
]]>re: poj 1011/uva 307 Sticks - dfs回溯 + 剪枝http://www.cppblog.com/y346491470/archive/2012/10/07/155318.html#192940y @ The Angry Teletubbiesy @ The Angry TeletubbiesSat, 06 Oct 2012 17:59:00 GMThttp://www.cppblog.com/y346491470/archive/2012/10/07/155318.html#192940就是说stick[j]在有更多可用的木棍都不能成功，那么你留到下次，可用的木棍更少了，肯定不可能成功，因为如果当前可以成功，那么之前一定可以成功了。

y @ The Angry Teletubbies 2012-10-07 01:59 发表评论
]]>re: poj 1011/uva 307 Sticks - dfs回溯 + 剪枝http://www.cppblog.com/y346491470/archive/2012/10/06/155318.html#192911一骑绝尘一骑绝尘Sat, 06 Oct 2012 09:07:00 GMThttp://www.cppblog.com/y346491470/archive/2012/10/06/155318.html#192911

一骑绝尘 2012-10-06 17:07 发表评论
]]>re: poj 1743 Musical Theme - 求不可重叠最长重复子串 + height数组分组 + 二分http://www.cppblog.com/y346491470/archive/2012/09/18/174840.html#191134RookieRookieTue, 18 Sep 2012 09:31:00 GMThttp://www.cppblog.com/y346491470/archive/2012/09/18/174840.html#191134

Rookie 2012-09-18 17:31 发表评论
]]>re: poj 1011/uva 307 Sticks - dfs回溯 + 剪枝http://www.cppblog.com/y346491470/archive/2012/07/31/155318.html#185733yyTue, 31 Jul 2012 02:44:00 GMThttp://www.cppblog.com/y346491470/archive/2012/07/31/155318.html#185733表示这种组合不行

y 2012-07-31 10:44 发表评论
]]>re: poj 1011/uva 307 Sticks - dfs回溯 + 剪枝http://www.cppblog.com/y346491470/archive/2012/07/31/155318.html#185732flozenflozenTue, 31 Jul 2012 02:42:00 GMThttp://www.cppblog.com/y346491470/archive/2012/07/31/155318.html#185732{
used[i]=true;
if(dfs(0,now+1,0,each))
return true;
used[i]=false;
return false;
}
请问博主,最后的return false有什么用?


flozen 2012-07-31 10:42 发表评论
]]>re: poj 1011/uva 307 Sticks - dfs回溯 + 剪枝http://www.cppblog.com/y346491470/archive/2012/07/09/155318.html#182301yyMon, 09 Jul 2012 03:30:00 GMThttp://www.cppblog.com/y346491470/archive/2012/07/09/155318.html#182301说的非常好

y 2012-07-09 11:30 发表评论
]]>