深度优先DFS
five_east_west
这个作者很懒,什么都没留下…
展开
-
牛客小白月赛28 C-单词记忆方法——dfs
单词记忆方法题目描述牛牛考完了四六级,准备分享一下自己的英语学习方法。牛牛:学习英语最重要的就是背单词,如果你能把所有的单词都记住,那么你的英语就能变成天下第一。然而牛牛的记忆方法就是把单词的每个字母转换成数字,把A看成1,B看成2,C看成3{}A看成1,B看成2,C看成3,依次类推,然后计算出来这个单词每个字母的和。从此每次想到这个单词,就要先想到这个单词的和,然后想办法凑出这个和。不久后,牛牛又对自己的记忆方法进行了更新,可以把重复的连续字母进行合并,比如把ABCABC写成(ABC)2,HH原创 2020-09-22 20:52:48 · 295 阅读 · 0 评论 -
牛客假日团队赛54 E-Mooyo Mooyo--------dfs搜索
Mooyo Mooyo题目描述由于手上(更确实的,蹄子上)有大把的空余时间,Farmer John的农场里的奶牛经常玩电子游戏消磨时光。她们最爱的游戏之一是基于一款人类中流行的电子游戏Puyo Puyo的奶牛版;名称当然叫做Mooyo Mooyo。Mooyo Mooyo是在一块细长的棋盘上进行的游戏,高NN(1≤N≤100)格,宽10格。 这是一个N=6的棋盘的例子:000000000000000003000054000300105450223022111222201111111223每原创 2020-09-20 20:29:17 · 153 阅读 · 0 评论 -
poj 3682 Bookshelf 2——背包问题(dfs)
Bookshelf 2DescriptionFarmer John recently bought another bookshelf for the cow library, but the shelf is getting filled up quite quickly, and now the only available space is at the top.FJ has N cows (1 ≤ N ≤ 20) each with some height of Hi (1 ≤ Hi ≤ 1,原创 2020-09-17 08:39:35 · 211 阅读 · 0 评论 -
vijos 1076 海战——搜索题(bfs or dfs)
海战 背景在峰会期间,武装部队得处于高度戒备。警察将监视每一条大街,军队将保卫建筑物,领空将布满了F-2003飞机。此外,巡洋船只和舰队将被派去保护海岸线。不幸的是因为种种原因,国防海军部仅有很少的几位军官能指挥大型海战。因此,他们考虑培养一些新的海军指挥官,他们选择了“海战”游戏来帮助学习。描述在这个著名的游戏中,在一个方形的盘上放置了固定数量和形状的船只,每只船却不能碰到其它的船。在这个题中,我们仅考虑船是方形的,所有的船只都是由图形组成的方形。编写程序求出该棋盘上放置的船只的总数。格式输入原创 2020-09-14 11:10:47 · 775 阅读 · 0 评论 -
poj 3083 Children of the Candy Corn——dfs与bfs的混合
Children of the Candy CornDescriptionThe cornfield maze is a popular Halloween treat. Visitors are shown the entrance and must wander through the maze facing zombies, chainsaw-wielding psychopaths, hippies, and other terrors on their quest to find the ex原创 2020-09-09 18:31:09 · 153 阅读 · 0 评论 -
poj 3009 Curling 2.0——dfs
Curling 2.0DescriptionOn Planet MM-21, after their Olympic games this year, curling is getting popular. But the rules are somewhat different from ours. The game is played on an ice game board on which a square mesh is marked. They use only a single stone原创 2020-09-09 11:30:30 · 235 阅读 · 0 评论 -
poj 2531 Network Saboteur——dfs
Network SaboteurDescriptionA university network is composed of N computers. System administrators gathered information on the traffic between nodes, and carefully divided the network into two subnetworks in order to minimize traffic between parts.A disg原创 2020-09-09 09:37:12 · 106 阅读 · 0 评论 -
poj 2488 A Knight‘s Journey——DFS深度优先搜索
A Knight’s JourneyDescriptionBackgroundThe knight is getting bored of seeing the same black and white squares again and again and has decided to make a journeyaround the world. Whenever a knight moves, it is two squares in one direction and one square原创 2020-09-08 17:42:46 · 172 阅读 · 0 评论 -
poj 1753 Flip Game——dfs深搜
Flip GameDescriptionFlip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other one is black and each piece is lying either it’s black or white side up. Each round y原创 2020-08-28 09:39:13 · 281 阅读 · 0 评论 -
poj 1416 Shredding Company——dfs搜索
Shredding CompanyDescriptionYou have just been put in charge of developing a new shredder for the Shredding Company Although a “normal” shredder would just shred sheets of paper into little pieces so that the contents would become unreadable, this new sh原创 2020-08-24 09:58:46 · 185 阅读 · 0 评论 -
poj 1129 Channel Allocation——四色定理
转载于:…(* ̄0 ̄)ノChannel AllocationDescriptionWhen 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 used by each repeater must be carefully c转载 2020-08-22 15:06:53 · 233 阅读 · 0 评论 -
poj 1033 Defragment——(搜索?)
转载于:https://www.cnblogs.com/damacheng/archive/2010/09/24/1833983.htmlDefragmentDescriptionYou are taking part in the development of a “New Generation” operating system and the NG file system. In this file system all disk space is divided into N clusters转载 2020-08-21 21:38:59 · 372 阅读 · 0 评论 -
poj 1022 Packing Unit 4D Cubes——dfs 搜索
转载于:(●’◡’●)Packing Unit 4D CubesDescriptionWe usually think that there are three geometric dimensions; the fourth dimension is usually time. However, the Association for Customizing Machines (ACM) has to deal with four geometrical dimensions for their转载 2020-08-21 11:43:45 · 171 阅读 · 0 评论 -
poj 1020 Anniversary Cake——dfs搜索
Anniversary CakeDescriptionNahid Khaleh decides to invite the kids of the “Shahr-e Ghashang” to her wedding anniversary. She wants to prepare a square-shaped chocolate cake with known size. She asks each invited person to determine the size of the piece原创 2020-08-20 12:04:04 · 136 阅读 · 0 评论 -
P1123 取数游戏——深度优先,dfs
P1123 取数游戏题目描述一个N×MN \times MN×M的由非负整数构成的数字矩阵,你需要在其中取出若干个数字,使得取出的任意两个数字不相邻(若一个数字在另外一个数字相邻88个格子中的一个即认为这两个数字相邻),求取出数字和最大是多少。输入格式第1行有一个正整数T,表示了有T组数据。对于每一组数据,第一行有两个正整数N和M,表示了数字矩阵为N行M列。接下来N行,每行M个非负整数,描述了这个数字矩阵。输出格式T行,每行一个非负整数,输出所求得的答案。输入输出样例输入 #134原创 2020-07-30 23:30:34 · 592 阅读 · 0 评论 -
N皇后问题
本文转自https://blog.csdn.net/Hackbuteer1/article/details/6657109N皇后问题是一个经典的问题,在一个N*N的棋盘上放置N个皇后,每行一个并使其不能互相攻击(同一行、同一列、同一斜线上的皇后都会自动攻击)。一、 求解N皇后问题是算法中回溯法应用的一个经典案例 回溯算法也叫试探法,它是一种系统地搜索问题的解的方法。回溯算法的基本思想是:从一条路往前走,能进则进,不能进则退回来,换一条路再试。 在现实中,有很多问题往往需要我们把其所有可能穷举出来转载 2020-07-31 22:41:19 · 158 阅读 · 0 评论 -
P1278 单词游戏——深度优先 dfs
题目描述Io和Ao在玩一个单词游戏。他们轮流说出一个仅包含元音字母的单词,并且后一个单词的第一个字母必须与前一个单词的最后一个字母一致。游戏可以从任何一个单词开始。任何单词禁止说两遍,游戏中只能使用给定词典中含有的单词。游戏的复杂度定义为游戏中所使用的单词长度总和。编写程序,求出使用一本给定的词典来玩这个游戏所能达到的游戏最大可能复杂度。输入格式输入文件的第一行,表示一个自然数N(1≤N≤16),N表示一本字典中包含的单词数量以下的每一行包含字典中的一个单词,每一个单词是由字母A、E、I、O原创 2020-08-01 21:10:05 · 364 阅读 · 1 评论