原创 HDOJ-1863-暢通工程
暢通工程 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 21617
原创 HDOJ-1242-Rescue
Rescue Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 21644
原创 HDOJ-2111-Saving HDU
Saving HDU Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 682
原创 HDOJ-1102-Constructing Roads
Constructing Roads Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission
原创 HDOJ-1301-POJ-Jungle Roads
Jungle Roads Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5
原创 HDOJ-1503-Advanced Fruits
Advanced Fruits Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s)
原创 HDOJ-1513-Palindrome
Palindrome Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 413
原创 qsort和sort的區別
qsort 基本快速排序的方法,每次把數組分成兩分和中間的一個劃分值,而對於有多個重複值的數組來說,基本排序的效率較低。集成在C語言庫函數裏面的的qsort函數,使用 三 路劃分的方法解決這個問題。所謂三路劃分,是指把數組劃分成小
原创 HDOJ-1875-暢通工程再續
暢通工程再續 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 20105
原创 HDOJ-2009-求數列的和
求數列的和 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 55901
原创 HDOJ-2004-成績轉換
成績轉換 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 94587
原创 Memset中無窮大常量的設定技巧
Memset中無窮大常量的設定技巧如果問題中各數據的範圍明確,那麼無窮大的設定不是問題,在不明確的情況下,很多程序員都取0x7fffffff作爲無窮大,因爲這是32-bit int的最大值。如果這個無窮大隻用於一般的比較(比如求最小值時m
原创 HDOJ-2005-第幾天
第幾天? Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 96054
原创 HDOJ-2003-求絕對值
求絕對值 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 82542
原创 HDOJ-2717-Catch That Cow
Catch That Cow Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s):