DFS
豫帝哥哥
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
展开
-
HDOJ Red and Black 1312(入门级DFS)
Red and BlackTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10410 Accepted Submission(s): 6505Problem DescriptionThere is a rect原创 2015-01-02 16:30:28 · 777 阅读 · 0 评论 -
POJ Lake Counting 2386(DFS)
Lake CountingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 21594 Accepted: 10873DescriptionDue to recent rains, water has pooled in various places in原创 2015-01-27 21:37:05 · 671 阅读 · 0 评论 -
ZOJ Seeding 2100【简单深搜】
SeedingTime Limit: 2 Seconds Memory Limit: 65536 KBIt is spring time and farmers have to plant seeds in the field. Tom has a nice field, which is a rectangle with n * m squares. There are原创 2015-08-04 18:03:06 · 907 阅读 · 0 评论 -
HDOJ Fire Net 1045【DFS+回溯】
Fire NetTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7919 Accepted Submission(s): 4511Problem DescriptionSuppose that we h原创 2015-08-04 23:40:23 · 714 阅读 · 0 评论 -
NYOJ 部分和问题 8(DFS)
部分和问题时间限制:1000 ms | 内存限制:65535 KB难度:2描述给定整数a1、a2、.......an,判断是否可以从中选出若干数,使它们的和恰好为K。输入首先,n和k,n表示数的个数,k表示数的和。接着一行n个数。(1输出如果和恰好可以为k,输出“YES”,并按输入顺序依次输出是由哪几个数的和组成,否则“NO”样例输入原创 2015-01-27 19:00:02 · 931 阅读 · 0 评论