原创 【圖論】割點、橋、雙連通

連通分量 個數可以通過一次BFS或者DFS得到 割點和橋 可以枚舉刪除每一個點或者每一條邊,判斷連通分量個數是否增加 更好的方法 該算法是R.Tarjan發明的。對圖深度優先搜索,定義DFS(u)爲u在搜索樹(以下簡稱爲樹)中被遍歷

原创 POJ 2234 Matches Game

Matches Game Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 9012   Accepted: 5214 Description Here is

原创 FZU 2140 Forever 0.5

Problem 2140 Forever 0.5 Problem Description Given an integer N, your task is to judge whether there exist N points i

原创 POJ 1179 Polygon

Polygon Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 5178   Accepted: 2192 Description Polygon is a

原创 HOJ 1014 Niven Numbers

Niven Numbers My Tags   (Edit)   Source : Unknown   Time limit : 1 sec   Memory limit : 32 M Submitted :

原创 HOJ 題目分類

****************************************************************************** * 簡單題(包括枚舉,二分查找,(複雜)模擬,基礎數據結構(棧、隊列),雜題等 

原创 3

http://www.cnblogs.com/zxndgv/archive/2011/08/06/2129333.html

原创 POJ 1780 Code

Code Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 2259   Accepted: 820 Description KEY Inc., the le

原创 Codeforces 589G Hiring (NEERC 2015 G題)

G. Hiring time limit per test 4 seconds memory limit per test 512 megabytes input standard input output s

原创 HDU 1317 XYZZY

XYZZY Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3608   

原创 Codeforces 508D Tanya and Password

D. Tanya and Password time limit per test 2 seconds memory limit per test 256 megabytes input standard inp

原创 Codeforces 589H Tourist Guide (NEERC 2015 H題)

H. Tourist Guide time limit per test 2 seconds memory limit per test 512 megabytes input standard input o

原创 HDU 5187 zhx's conte

zhx's contest Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s

原创 Codeforces 585D Lizard Era: Beginning

D. Lizard Era: Beginning time limit per test 2 seconds memory limit per test 256 megabytes input standard i

原创 HDU 5492 Find a path

Find a path Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 9