原创 NTHU OJ 10924
Program link: http://acm.cs.nthu.edu.tw/problem/10924/ Description 實作Max heap的三種操作:push, pop, top。 指令0 x:代表push
原创 NTHU OJ 10958 - 樹的最長路徑
Link: http://acm.cs.nthu.edu.tw/problem/10958/ Description 樹的最長路徑 題目內容: 給定一顆無根樹,請找出他最長路徑的長度 Input 輸入第一行為一個
原创 hdu-2035-人見人愛A^B-數的快速冪
Link: http://acm.hdu.edu.cn/showproblem.php?pid=2035 人見人愛A^B Time Limit: 2000/1000 MS (Java/Others) Memory Limit
原创 hdu-1003-Max Sum-動態規劃dp
Link:http://acm.hdu.edu.cn/showproblem.php?pid=1003 Max Sum Time Limit: 2000/1000 MS (Java/Others) Memory Limit:
原创 NTHU OJ 1015 - May the Right Force with you-圖論
Problem Link:http://acm.cs.nthu.edu.tw/problem/1015/ Description In a sensational scene in the 8-th installment of th
原创 hdu-2037-今年暑假不AC-簡單DAG
Link: http://acm.hdu.edu.cn/showproblem.php?pid=2037 今年暑假不AC Time Limit: 2000/1000 MS (Java/Others) Memory Limit
原创 hdu-1317-XYZZY-Bellman-Ford判環、Floyd算法
Link: http://acm.hdu.edu.cn/showproblem.php?pid=1317 XYZZY Time Limit: 2000/1000 MS (Java/Others) Memory Limit:
原创 2015年山東省第六屆ACM大學生程序設計競賽-B-Lowest Unique Price
Link: http://www.sdutacm.org/sdutoj/problem.php?action=showproblem&problemid=3252 Lowest Unique Price Time Limit:
原创 hdu-1077-Catching Fish-計算幾何、枚舉圓心
Link: http://acm.hdu.edu.cn/showproblem.php?pid=1077 Catching Fish Time Limit: 10000/5000 MS (Java/Others) Memor
原创 hdu oj 2444 The Accomodation of Students-二部圖
Link:http://acm.hdu.edu.cn/showproblem.php?pid=2444 The Accomodation of Students Time Limit: 5000/1000 MS (Java/Others)
原创 hdu-2680-Choose the best route
Link: (http://acm.hdu.edu.cn/showproblem.php?pid=2680) Choose the best route Time Limit: 2000/1000 MS (Java/Oth
原创 hdu-1018-Big Number-簡單數學
Link: http://acm.hdu.edu.cn/showproblem.php?pid=1018 Big Number Time Limit: 2000/1000 MS (Java/Others) Memory Li
原创 2014年山東省第五屆ACM大學生程序設計競賽-B-Circle
Circle Time Limit: 2000ms Memory limit: 65536K 題目描述 You have been given a circle from 0 to n - 1. If you
原创 poj-3735-Training little cats-矩陣快速冪
Link:http://poj.org/problem?id=3735 Training little cats Time Limit: 2000MS Memory Limit: 65536K Total Submiss
原创 hdu-1102-Constructing Roads-最小生成樹,Kruskal算法
Constructing Roads Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submis