原创 Dijkstra所得生成樹是否是最小生成樹

原文反例鏈接

原创 UVA 11627 Fire!

題目鏈接 Description Joe works in a maze. Unfortunately, portions of the maze havecaught on re, and the owner of the

原创 HUST 1017 Exact cover(DLX精確覆蓋)·(轉載)

題目鏈接 思路鏈接(轉載) 代碼鏈接(轉載) There is an N*M matrix with only 0s and 1s, (1 <= N,M <= 1000). An exact cover is a selectio

原创 HDU 1067 Gap

題目鏈接 char = int 小數字直接映射字符串 感謝[kuangbin]的專題,學到了許多 Problem Description Let’s play a card game called Gap. You have 2

原创 HDU 1560 sequence

題目鏈接 Problem Description The twenty-first century is a biology-technology developing century. We know that a gene i

原创 關鍵路徑算法(轉載)

關鍵路徑原理 關鍵路徑代碼

原创 強連通分量分解——Tarjan、Gabow、Kosaraju 算法(轉載)

強連通分量——百度百科 Tarjan算法原理與模板 Gabow算法原理與模板 Kosaraju算法原理 Kosaraju算法模板

原创 POJ 3360 Cow Contest

Description N (1 ≤ N ≤ 100) cows, conveniently numbered 1…N, are participating in a programming contest. As we all

原创 POJ 2253 Frogger

題目鏈接 Description Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is s

原创 POJ 2378 Til the Cows Come Home

題目鏈接 Description Bessie is out in the field and wants to get back to the barn to get as much sleep as possible befo

原创 HDU 3085 Nightmare Ⅱ

題目鏈接 Problem Description Last night, little erriyue had a horrible nightmare. He dreamed that he and his girl frien

原创 HDU 3533 Escape

題目鏈接 Problem Description The students of the HEU are maneuvering for their military training. The red army and the

原创 HDU 2181 哈密頓繞行世界問題

題目鏈接 Problem Description 一個規則的實心十二面體,它的 20個頂點標出世界著名的20個城市,你從一個城市出發經過每個城市剛好一次後回到出發的城市。 Input 前20行的第i行有3個數,表示與第i個城市相鄰

原创 HDU 3567 Eight II

題目鏈接 太太太棒了,又又又學到了許多 Problem Description Eight-puzzle, which is also called “Nine grids”, comes from an old game. I

原创 HDU 1043 Eight

題目鏈接 康託展開與逆使用 題目思路演化過程 題目代碼演化過程 感謝[kuangbin]的專題,太棒了,學到了許多 Problem Description The 15-puzzle has been around for ov