DFS
gx翔鸽
革命尚未成功,同志任需努力,先改造自己
展开
-
CodeForces - 723D ——Lakes in Berland【DFS】
The map of Berland is a rectangle of the size n × m, which consists of cells of size 1 × 1. Each cell is either land or water. The map is surrounded by the ocean.Lakes are the maximal regions of wat...原创 2018-08-03 23:06:00 · 217 阅读 · 0 评论 -
luoguP1019——单词接龙【DFS】
单词接龙题目链接如上。题目大致思路:首先我们知道了首字母是哪一个,然后我们就可以一一枚举其他所有字母找到拼接最长的。这道题的难点就在于拼接操作。我们可以枚举两个拼接字符串的所有接口长度,判断该接口长度是否能够进行拼接,如果可以则继续搜索。同时我们还需要用一个数组记录一下每一个字符的使用次数,每一个字符的使用最多一次。#include <algorithm>#includ...原创 2019-03-31 09:27:30 · 209 阅读 · 0 评论 -
UVA208—— Firetruck【DFS + 并查集】
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 day, several streets ar...原创 2018-12-31 18:46:25 · 175 阅读 · 0 评论 -
POJ2248——Addition Chains【DFS,迭代加深搜索】
题目连接:http://poj.org/problem?id=2248题目大意:现在有一个数组其中a[1] = 1,a[m] = n,并且a[1] < a[2] < ........< a[m],现在给你一个数n问,满足条件的m的最小值为多少。其中1 <= n <= 9大致思路:如果我们按照DFS直接搜索的话,一共有n!个节点十分耗时,这个时候我们可以采用迭代...原创 2018-11-30 21:59:59 · 1043 阅读 · 0 评论 -
POJ1321——棋盘问题【DFS】
棋盘问题Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 65039 Accepted: 31045 Description在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求解对于给定形状和大小的棋...原创 2018-08-02 23:45:04 · 136 阅读 · 0 评论 -
CodeForces 510B——Fox And Two Dots【DFS】
Fox Ciel is playing a mobile puzzle game called "Two Dots". The basic levels are played on a board of size n × m cells, like this:Each cell contains a dot that has some color. We will use differen...原创 2018-08-02 23:37:23 · 196 阅读 · 0 评论 -
HDU1241——Oil Deposits【DFS求联通区域数量】
Oil DepositsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 42171 Accepted Submission(s): 24453 Problem DescriptionThe GeoSurvComp ge...原创 2018-08-02 23:30:41 · 150 阅读 · 0 评论 -
HDU1010——Tempter of the Bone【DFS,奇偶剪枝,路径剪枝】
Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 146756 Accepted Submission(s): 39139 Problem DescriptionThe doggie...原创 2018-08-02 23:24:19 · 182 阅读 · 0 评论 -
hdu1312——Red and Black【DFS/BFS】
Red and BlackTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25836 Accepted Submission(s): 15596 Problem DescriptionThere is a rectan...原创 2018-08-02 23:17:07 · 123 阅读 · 0 评论 -
Equivalent Strings 【DFS】
Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings a and b of equal length are called equivalent in one of the two cases:They are equal. If we split...原创 2018-08-03 23:10:55 · 94 阅读 · 0 评论 -
洛谷P1101——单词方阵
单词方阵大致思路:首先我们可以遍历整个单词方阵,找到每一个y开头的地方,然后沿着这8个方向寻找i,如果找到了i,我们就可以沿着这个方向继续查找下去,在查找的过程中我们要保证下一个单词必须与“yizhong”里相应次序的单词相同。#include <iostream>#include <algorithm>#include <cstring>#in...原创 2019-03-31 09:34:58 · 248 阅读 · 0 评论