HDOJ搜索題(總計100題)

DFS(Depth First Search )

一般是不用hash的,所以很多時候稱之爲”暴力”,也就是窮舉所有情況,一般看幾個我們OJ的dfs的版本的題目就可以模仿着做了,因爲牽涉到遞歸,初學者學的時候最好能舉一反三,理解其中真諦.

DFS --- EASY(15)

Tempter of the Bone

Safecracker

Prime Ring Problem

Robot Motion

Fire Net

猜數字

Oil Deposits

Sum It Up

Red and Black

Shredding Company

Krypton Factor

Rank

How Many EquationsCan You Find

Accepted Necklace

Lotto

一般的DFS有時候可能會加入一些DP的思想,從而就變成了記憶化搜索,原理是將以前算過的狀態記錄下來,接下來的訪問就不用繼續遞歸計算,以後直接用就好了.

DFS + DP --- EASY(7)

FatMouse and Cheese

A Walk Through theForest

Pascal's Travels

Anniversary party

Unidirectional TSP

Numbering Paths

Dota all stars

DFS + DP --- NORMAL(1)

Islands and Bridges

DFS --- NORMAL(16)

Sticks

Transportation

Square

IncreasingSequences

Free Candies

Anagrams by Stack

Station Balance

A Puzzling Problem

Vase collection

哈密頓繞行世界問題

NecklaceDecomposition

Barbara Bennett'sWild Numbers

Sequence one

Islands

Pipes

No Left Turns

BFS(Breadth First Search )

http://cache.baidu.com/c?m=9d78d513d9d431a44f9a95697d12c017134381132ba1d1020ed38439e7732a4b506793ac56520772d0d20d1716db4c48adb0687d6d4566f58cc9fb57c0fed76d388850763041d301418c4dfc975125b671cd05f4ff47baefed61d3e88982810344ca24563bc2e78a2e5b42dd6e86123ae6a49e&p=81759a41dc9601f201be9b7a5c40&user=baidu

BFS --- EASY(17)

Ignatius and thePrincess I

Nightmare

詭異的樓梯

Open the Lock

超級密碼

Asteroids!

Rescue

Hike on a Graph

勝利大逃亡

N-Credible Mazes

Knight Moves

Basic wall maze

A strange lift

A計劃

Game III

Hiking Trip

Hamburger Magi

BFS --- NORMAL(27)

Gap

Remainder

The Proper Key

勝利大逃亡(續)

The Treasure

Bubble Shooter

Copying DNA

Full Tank?

Cheesy Chess

Push Box

Key Task

Frogger

Prime Path

Frogger

Escape from EnemyTerritory

Escape

Bus Pass

Marbles in ThreeBaskets

Treasure of theChimp Island

逃離迷宮

find the neareststation

Dogs

Lode Runner

Tobo or not Tobo

Sum of Digits

Escape

An interesting mobilegame

BFS+DFS --- EASY(4)

Collect More Jewels

推箱子

Different Digits

Kaitou Kid - ThePhantom Thief (2)

DoubleDirectionBFS(3)

Solitaire

魔板

Bridged MarbleRings

BS( Binary Search )(5)

這類題目一般不會單一隻有一個算法,一般都是二分+?(最大流,二分匹配,貪心,DP)等等,這裏僅列出二分枚舉的題目,即二分枚舉答案,然後判斷可行與否。

The Balance

Equations

Cable master

Sum Zero

Pie

IDA Star (4)

迭代加深本身不難,但是好的剪枝比較難想

DNA sequence

The Rotation Game

Booksort

Escape from Tetris

發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章