
搜索-剪枝
文章平均质量分 81
STILLxjy
不要让任何人打乱你生活的节奏
展开
-
(HDU 1078) FatMouse and Cheese 记忆化搜索
FatMouse and Cheese Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8705 Accepted Submission(s): 3653Problem Description FatMouse has stor原创 2016-10-15 16:15:47 · 479 阅读 · 0 评论 -
(POJ1129)Channel Allocation <涂色问题问最少颜色数 剪枝搜索 > || <四色定律>
Channel Allocation DescriptionWhen a radio station is broadcasting over a very large area, repeaters are used to retransmit the signal so that every receiver has a strong signal. However, the channels原创 2016-12-19 12:03:09 · 1224 阅读 · 0 评论 -
(POJ2676)Sudoku <简单数独问题>
Sudoku DescriptionSudoku is a very simple task. A square table with 9 rows and 9 columns is divided to 9 smaller squares 3x3 as shown on the Figure. In some of the cells are written decimal digits fro原创 2016-12-19 14:05:01 · 955 阅读 · 0 评论 -
(POJ 1724)ROADS <DFS + 简单剪枝>
ROADS DescriptionN cities named with numbers 1 … N are connected with one-way roads. Each road has two parameters associated with it : the road length and the toll that needs to be paid for the road (原创 2017-01-04 14:13:34 · 531 阅读 · 0 评论 -
(POJ 1691)Painting A Board <top序列 + DFS>
Painting A Board DescriptionThe CE digital company has built an Automatic Painting Machine (APM) to paint a flat board fully covered by adjacent non-overlapping rectangles of different sizes each with原创 2017-01-04 17:01:40 · 517 阅读 · 0 评论 -
(LeetCode 39)组合总和 [DFS: 暴力搜索 + 剪枝 + 去重]
39. 组合总和给定一个无重复元素的数组 candidates 和一个目标数 target ,找出 candidates 中所有可以使数字和为 target 的组合。candidates 中的数字可以无限制重复被选取。说明:所有数字(包括 target)都是正整数。解集不能包含重复的组合。示例 1:输入: candidates = [2,3,6,7], target = 7,所求解...原创 2018-11-01 21:48:34 · 765 阅读 · 0 评论