回溯
文章平均质量分 75
HelloWorld10086
追随大神的脚步
展开
-
UVA - 10160 Servicing Stations(回溯+剪枝)
Problem D: Servicing stationsA company offers personal computers for sale in N towns (3 <= N <= 35). The towns are denoted by 1, 2, ..., N. There are direct routes connecting M pairs from among th原创 2014-08-18 14:03:27 · 926 阅读 · 0 评论 -
UVA - 167 The Sultan's Successors(回溯 八皇后问题改编)
The Sultan's Successors The Sultan of Nubia has no children, so she has decided that the country will be split into up to k separate parts on her death and each part will be inherited by w原创 2014-08-15 14:35:53 · 967 阅读 · 0 评论 -
UVA - 193 Graph Coloring(回溯)
Graph Coloring You are to write a program that tries to find an optimal coloring for a given graph. Colors are applied to the nodes of the graph and the only available colors are black and原创 2014-08-16 15:49:01 · 828 阅读 · 0 评论 -
UVA - 140 Bandwidth(全排列枚举)
Bandwidth Given a graph (V,E) where V is a set of nodes and E is a set of arcs in VxV, and an ordering on the elements in V, then the bandwidth of a node v is defined as the maximum distan原创 2014-08-16 11:50:31 · 796 阅读 · 0 评论 -
UVA - 208 Firetruck(回溯)
Firetruck The Center City fire department collaborates with the transportation department to maintain maps of the city which reflects the current status of the city streets. On any given d原创 2014-08-16 19:44:57 · 628 阅读 · 0 评论 -
UVA - 10123 No Tipping(回溯+剪枝+贪心)
Problem A - No TippingAs Archimedes famously observed, if you put an object on a lever arm, it will exert a twisting force around the lever's fulcrum. This twisting is called torque and is equal to原创 2014-08-17 19:18:55 · 722 阅读 · 0 评论 -
UVA - 307 Sticks(回溯+剪枝)
Sticks George took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many原创 2014-08-18 20:43:29 · 799 阅读 · 0 评论 -
UVA - 10001 Garden of Eden (回溯)
Garden of Eden Cellular automata are mathematical idealizations of physical systems in which both space and time are discrete, and the physical quantities take on a finite set of discret原创 2014-08-15 20:18:45 · 1407 阅读 · 1 评论 -
HDU 1518 Square(回溯)
题目大意:给你n个棍子,要求将所有的棍子都用上,拼成一个正方形。解析:回溯+剪枝,用一个pos来记录搜索到的位置,当下次搜索时,从上一次结束的位置开始搜索。总结:这题写剪枝的时候把dfs(i+1,sum+s[i],cnt)写成了dfs(pos+1,sum+s[i],cnt),结果一直超时,浪费了好的时间来找错误,下次要吸取教训。原创 2014-10-13 14:52:06 · 789 阅读 · 0 评论 -
HDU - 5004 KAMI(回溯+dfs)
题目大意:这题的规则和KAMI游戏的规则相同。可以百度一下这个游戏。规则大概如下:有一个 16*10 由4种颜色组成的图,你可以用任意一种颜色对这个图上颜色不相同的点进行染色,染色的同时,其周围上的颜色相同的点,也被染色成你要染的颜色。问你能否用至少n步,将图片染成1中颜色。解析:此题给出了最小步数n其实对于每次选择一个点变颜色,等价于每次都对同一个点改变颜色。原创 2014-10-31 19:47:47 · 1257 阅读 · 0 评论 -
HDU - 1426 Sudoku Killer(回溯)
数独问题,今天蓝桥杯校赛没把这题做出来,和学长聊了一下,可能是我对于回溯的理解不够深入。所以今晚补了一下数独的代码。解析:这题和八皇后问题相似,可以开一个3数组,分别标记该行用了什么数字,该列用了什么数字,和该方块用了什么数字,如果遇到标记过了数字,就跳过。总结:这是省赛前的最后一题,复习一下回溯,祝愿我明天省赛好运。#include #include #include #inc原创 2014-11-29 23:34:26 · 802 阅读 · 0 评论 -
UVA 1352 Colored Cubes(回溯)
题目大意: 给出n个正方体,然后n行表示每个正方体6个面的上色,问涂最少的面使得n正方体都相同(注意正方体是可以旋转的)。解析: 首先写出正方体有24个旋转方式,然后以第一个正方体为标准,枚举剩下n - 1个正方体的状态,然后计算最小值。具体见代码注释。 #include <cstdio>#include <cstring>#include <algorithm>#include原创 2015-02-08 11:22:47 · 475 阅读 · 0 评论 -
UVA - 10624 Super Number(回溯)
Super NumberInput: Standard InputOutput: Standard OutputTime Limit: 3 Seconds Don't you think 162456723 very special? Look at the picture below if you are unable to find its speciality. (a |原创 2014-09-04 16:06:17 · 759 阅读 · 0 评论 -
UVA - 11210 Chinese Mahjong(回溯)
Problem CChinese MahjongMahjong () is a game of Chinese origin usually played by four persons with tiles resembling dominoes and bearing various designs, which are drawn and discarded until on原创 2014-09-03 21:07:36 · 1128 阅读 · 0 评论 -
回溯法算法框架及基础
回溯法其实也是一种搜索算法,它可以方便的搜索解空间。 回溯法解题通常可以从以下三步入手: 1、针对问题,定义解空间 2、确定易于搜索的解空间结构 3、以深度优先的方式搜索解空间,并在搜索的过程中进行剪枝 回溯法通常在解空间树上进行搜索,而解空间树通常有子集树和排列树。 针对这两个问题,算法的框架基本如下: 用回溯法搜索子集合树的一般框架:vo转载 2014-08-11 11:03:40 · 929 阅读 · 0 评论 -
UVALive 3667 Ruler(回溯搜索)
题意: 给出n种距离,设计一个有m个刻度的尺子,使得每个刻度都可以直接量出,要求在m尽量小的情况下尺子的总长度尽量短,第一个必须是0,输出保证m<=7m<=7。解析: 回溯搜索,先确定下第一个刻度是0,第二个刻度是d[0],用vis数组来记录每个d[i]d[i]是否被用过,然后枚举 arr[j]+d[i]arr[j] + d[i],arrarr数组指的是当前已经选出的刻度,当arr[j]+原创 2015-07-17 19:29:58 · 873 阅读 · 0 评论 -
hdu 5339 Untitled(回溯)
题意: 一个整数a 和一个数组b,问你是否能在b中取出r个元素排列组成c数组满足a%c1%c1%…..%cr == 0。输出最小的r,不能满足条件输出-1。解析: b按从小到大排序,回溯搜索。 如果当前搜到的值 <b那么直接return,因为a对比它大的数字取模还是等于本身没有意义。mymy codecode#include <cstdio>#include <cstring>原创 2015-08-02 10:27:07 · 447 阅读 · 0 评论 -
UVA - 10012 How Big Is It?(全排列 堆球问题)
How Big Is It? Ian's going to California, and he has to pack his things, including his collection of circles. Given a set of circles, your program must find the smallest rectangular box原创 2014-08-14 10:13:20 · 1012 阅读 · 0 评论 -
UVA - 10344 23 out of 5(回溯+全排列)
Problem I23 Out of 5Input: standard inputOutput: standard outputTime Limit: 1 secondMemory Limit: 32 MBYour task is to write a program that can decide whether you can find an arithmetic ex原创 2014-08-12 19:05:28 · 675 阅读 · 0 评论 -
UVA - 387 A Puzzling Problem(回溯)
A Puzzling Problem The goal of this problem is to write a program which will take from 1 to 5 puzzle pieces such as those shown below and arrange them, if possible, to form a square. An ex原创 2014-08-20 19:48:09 · 734 阅读 · 0 评论 -
UVA - 519 Puzzle (II)(回溯+剪枝)
Puzzle (II) Little Barborka has just started to learn how to solve a picture puzzle. She has started with a small one containing 15 pieces. Her daddy tries to solve the puzzle too. To make原创 2014-08-22 08:33:32 · 719 阅读 · 0 评论 -
FZU - 2107 Hua Rong Dao(回溯)
Hua Rong DaoTime Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64u[Submit] [Go Back] [Status] DescriptionCao Cao was hunted down原创 2014-08-14 22:58:25 · 849 阅读 · 0 评论 -
HDU - 2553 N皇后问题 (初试回溯)
N皇后问题Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription在N*N的方格棋盘放置了N个皇后,使得它们不相互攻击(即任意2个皇后不允许处在同一排,同一列,也不允许处在与棋盘边框成45角的斜线上。你的任务是,对于给原创 2014-08-11 09:47:43 · 1684 阅读 · 0 评论 -
UVA - 524 Prime Ring Problem (经典回溯问题)
Prime Ring Problem A ring is composed of n (even number) circles as shown in diagram. Put natural numbers into each circle separately, and the sum of numbers in two adjacent circles shou原创 2014-08-11 10:46:01 · 765 阅读 · 0 评论 -
UVA - 529 Addition Chains(迭代+dfs)
Addition Chains An addition chain for n is an integer sequence $"> with the following four properties:a0 = 1am = na012m-1mFor each k ( ) there exist two (not neccessarily different原创 2014-08-22 16:22:21 · 905 阅读 · 0 评论 -
UVA - 216 Getting in Line (全排列枚举 和 回溯两种解法)
Getting in Line Computer networking requires that the computers in the network be linked. This problem considers a ``linear" network in which the computers are chained together so that e原创 2014-08-11 20:30:36 · 1034 阅读 · 0 评论 -
UVA - 502 DEL command(字符串)
DEL command It is required to find out whether it is possible to delete given files from MS-DOS directory executing the DEL command of MS-DOS operation system only once. There are no neste原创 2014-08-24 18:26:10 · 1036 阅读 · 0 评论 -
UVA - 185 Roman Numerals(回溯+剪枝)
Roman Numerals The original system of writing numbers used by the early Romans was simple but cumbersome. Various letters were used to represent important numbers, and these were then st原创 2014-08-23 14:47:28 · 1081 阅读 · 0 评论 -
UVA - 565 Pizza Anyone?(状态压缩+暴利枚举)
Pizza Anyone? You are responsible for ordering a large pizza for you and your friends. Each of them has told you what he wants on a pizza and what he does not; of course they all underst原创 2014-08-23 20:39:09 · 978 阅读 · 0 评论 -
UVA - 539 The Settlers of Catan (回溯水题)
The Settlers of Catan Within Settlers of Catan, the 1995 German game of the year, players attempt to dominate an island by building roads, settlements and cities across its uncharted wilde原创 2014-08-12 14:06:06 · 791 阅读 · 0 评论 -
UVA - 639 Don't Get Rooked (回溯)
Don't Get Rooked In chess, the rook is a piece that can move any number of squaresvertically or horizontally. In this problem we will consider smallchess boards (at most 44) that can als原创 2014-08-12 10:43:18 · 694 阅读 · 0 评论 -
UVA - 129 Krypton Factor (回溯)
Krypton Factor You have been employed by the organisers of a Super Krypton Factor Contest in which contestants have very high mental and physical abilities. In one section of the contest t原创 2014-08-11 15:35:36 · 897 阅读 · 0 评论 -
UVA - 301 Transportation (回溯)
Transportation Ruratania is just entering capitalism and is establishing new enterprising activities in many fields including transport. The transportation company TransRuratania is starti原创 2014-08-12 16:33:18 · 774 阅读 · 0 评论 -
UVA - 331 Mapping the Swaps(回溯)
Mapping the Swaps Sorting an array can be done by swapping certain pairs of adjacent entries in the array. This is the fundamental technique used in the well-known bubble sort. If we lis原创 2014-08-12 20:29:59 · 605 阅读 · 0 评论 -
UVA - 110 Meta-Loopless Sorts(元排序 回溯)
Meta-Loopless Sorts Background Sorting holds an important place in computer science. Analyzing and implementing various sorting algorithms forms an important part of the education of原创 2014-08-13 16:15:54 · 787 阅读 · 0 评论 -
hdu 5355 Cake(构造+回溯)
题意: 给出一个蛋糕,切成1~n大小的n块,问能否在不继续切割的情况下拼凑出m等份。解析: 首先可以求出这些蛋糕的总和n∗(n+1)/2n*(n+1)/2,如果总和sum%m != 0那么就不肯能被平分成m份,那么输出”NO”。 接下来计算平均数avg=sum/mavg = sum/m,如果平均数avg < n的话,蛋糕是不可能用完的,同样也输出”NO”。 剩下的情况蛋糕是一定原创 2015-08-07 12:27:42 · 1292 阅读 · 0 评论