 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
深搜，32ms飘过，题目的限制居然是10s?这道题目只要是搜索不能重复，先搜出可能的组合，再在这个基础上找出可行的组合，有几个关键点，第一是长度不能是由一个木棒自己组成的，第二长度至少是stick[0]+stick[5](sticks排序后)，第三是最关键的，减去相同的剪枝，避免重复！ 参考代码：http://lovekid1987.blog.163.com/blog/static/1151842102009849522322/ Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
