原创 HDU 1143 Tri Tiling （遞推）
Tri Tiling Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2118
2020-07-06 09:10:03
原创 HDU 2571 命運 (動規)
命運 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9334 Acc
2020-07-06 09:10:03
原创 POJ 3628 Bookshelf 2 (01揹包)
Bookshelf 2 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7496 Accepted: 3451 Description Farmer J
2020-07-06 09:10:03
原创 HDU 2112 HDU Today (Dijkstra算法)
HDU Today Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1395
2020-07-06 09:10:03
原创 POJ 2955 Brackets (動規)
Brackets Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 2999 Accepted: 1536 Description We give the
2020-07-06 09:10:03
原创 POJ 1014 Dividing (多重揹包)
Dividing Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 58921 Accepted: 15200 Description Marsha and
2020-07-06 09:10:03
原创 HDU 1072 Nightmare (BFS)
Nightmare Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 17 A
2020-02-23 10:36:49
原创 HDU 2066 一個人的旅行(最短路徑)
一個人的旅行 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18343
2020-02-23 10:36:49
原创 HDU 1874 暢通工程續 (最短路徑)
暢通工程續 Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 26735
2020-02-23 10:36:49
原创 POJ 1050 To the Max (動規)
To the Max Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 40302 Accepted: 21329 Description Given a two
2020-02-23 10:36:49
原创 HDU 1160 FatMouse's Speed (動規+最長遞減子序列)
FatMouse's Speed Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s)
2020-02-23 10:36:49
原创 HDU1253 勝利大逃亡 BFS
勝利大逃亡 Time Limit : 4000/2000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 15 Acce
2020-02-23 10:36:49
原创 HDU 2830 Matrix Swapping II （最大完全子矩陣之可移動列）
Matrix Swapping II Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(
2020-02-23 10:36:49
原创 硬幣找零問題
硬幣找零問題 硬幣找零問題一個經典問題，也是闡述動態規劃法幾乎必講的一個例子。 硬幣找零問題描述：現存在一堆面值爲 V1、V2、V3 … 個單位的硬幣， 各單位的硬幣數目不限， 問最少需要多少個硬幣才能找出總值爲 T 個單位的零錢？ 比
2020-02-23 10:36:49