搜索
文章平均质量分 83
圣诞老人家
这个作者很懒,什么都没留下…
展开
-
HDU 3984 迷宫问题
定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0,};它表示一个迷宫,其中的1表示墙壁,0表示可以走的路,只能横着走或竖着走,不能斜着走,要求编程序找出从左上角到右下角的最短路线。 Input一个5原创 2017-03-20 20:32:02 · 1207 阅读 · 0 评论 -
hdu 4474 dfs+减枝
There are tons of problems about integer multiples. Despite the fact that the topic is not original, the content is highly challenging. That’s why we call it “Yet Another Multiple Problem”. In this原创 2017-09-16 10:53:09 · 235 阅读 · 0 评论 -
hdu 6178 dfs+超神读入挂
Problem DescriptionThere is a tree having N vertices. In the tree there are K monkeys (K <= N). A vertex can be occupied by at most one monkey. They want to remove some edges and leave minimum edg原创 2017-08-29 21:23:10 · 353 阅读 · 0 评论 -
hdu 6044 dfs+组合数
Problem DescriptionAs to a permutation p1,p2,⋯,pn from 1 to n, it is uncomplicated for each 1≤i≤n to calculate (li,ri) meeting the condition that min(pL,pL+1,⋯,pR)=pi if and only if li≤L≤i原创 2017-08-29 20:41:28 · 315 阅读 · 0 评论 -
hdu6171 双向搜索+hash
Suppose that you are an admiral of a famous naval troop. Our naval forces have got 21 battleships. There are 6 types of battleships.First, we have got one flagship in which the admiral must be and i原创 2017-08-26 22:02:02 · 581 阅读 · 0 评论 -
hdu5971 Wrestling Match
Nowadays, at least one wrestling match is held every year in our country. There are a lot of people in the game is "good player”, the rest is "bad player”. Now, Xiao Ming is referee of the wrestling m原创 2017-06-09 23:11:46 · 329 阅读 · 0 评论 -
hdu4574 Bombs 枚举+dfs
Terrorists are around everywhere, they always make troubles by detonating bombs. The terrorist have some gunpowder to make bombs, different gunpowder has different damage, every kind of gunpowder can原创 2017-06-02 19:44:19 · 291 阅读 · 0 评论 -
fzu Fire Game bfs
Fat brother and Maze are playing a kind of special (hentai) game on an N*M board (N rows, M columns). At the beginning, each grid of this board is consisting of grass or just empty and then they start原创 2017-05-25 07:27:14 · 1043 阅读 · 0 评论 -
HDU - 4607 Park Visit 求一个图中的最长链
Claire and her little friend, ykwd, are travelling in Shevchenko's Park! The park is beautiful - but large, indeed. N feature spots in the park are connected by exactly (N-1) undirected paths, and Cla原创 2017-05-03 16:04:48 · 1461 阅读 · 0 评论 -
HDU - 4619 I - Warm up 2
Some 1×2 dominoes are placed on a plane. Each dominoe is placed either horizontally or vertically. It's guaranteed the dominoes in the same direction are not overlapped, but horizontal and vertical do原创 2017-04-06 17:58:03 · 286 阅读 · 0 评论 -
poj 2251 bfs基础
DescriptionYou are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one原创 2017-03-22 21:33:50 · 309 阅读 · 0 评论 -
Gym 101196D Lost in Translation (bfs)
打比赛的时候没来得及看这道题目,现在补上题目大意就是给你一篇文章,初始状态是英文,然后给出以多种语言,和一些语言之间翻译需要的成本,然后问你找出在翻译成所有语言的最低成本,但是这里还有一个条件特别重要,那就是救过必须要满足翻译成某种语言的过程必须是最短路径,理解一下,对某一种语言来说也就是求一下该语言的所有最短路径中的最低成本思路:首先先建一下图了当然是,这种题不用看,将字符串转化原创 2017-03-29 20:44:04 · 387 阅读 · 0 评论 -
poj1321 棋盘问题 dfs
在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求解对于给定形状和大小的棋盘,摆放k个棋子的所有可行的摆放方案C。Input输入含有多组测试数据。 每组数据的第一行是两个正整数,n k,用一个空格隔开,表示了将在一个n*n的矩阵内描述棋盘,以及摆放棋子的数目。 n <= 8 , k <= n 当为-1...原创 2017-03-22 20:48:16 · 267 阅读 · 0 评论 -
hdu 2612 Find a way
Problem DescriptionPass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Especially a good friend Merceki.Yifenfe原创 2017-03-21 20:11:05 · 213 阅读 · 0 评论 -
hdu1495 非常可乐 bfs基础
大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S<101)毫升 (正好装满一瓶) ,它们三个之间可以相互倒可乐 (都是没有刻度的,且 S==N+M,101>S>...原创 2017-03-21 15:59:03 · 1061 阅读 · 0 评论 -
HDU 1241 Oil Deposits dfs
The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides th...原创 2017-03-20 21:09:48 · 263 阅读 · 0 评论 -
图论基础(bfs+dfs简介)
图是一种灵活的数据结构,一般作为一种模型用来定义对象之间的关系或联系。对象由顶点(V)表示,而对象之间的关系或者关联则通过图的边(E)来表示。图可以分为有向图和无向图,一般用G=(V,E)来表示图。经常用邻接矩阵或者邻接表来描述一副图。在图的基本算法中,最初需要接触的就是图的遍历算法,根据访问节点的顺序,可分为广度优先搜索(BFS)和深度优先搜索(DFS)。广度优先搜索(BFS)广度优先搜索在进一...原创 2018-03-14 10:09:45 · 1138 阅读 · 0 评论