原创 poj2096之概率DP入門

Collecting Bugs Time Limit: 10000MS   Memory Limit: 64000K Total Submissions: 2041   Accepted: 974 Case Time Limit: 

原创 hdu3377之簡單路徑求最值

Plan Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 686    

原创 hdu1827之強聯通

Summer Holiday Time Limit: 10000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(

原创 hdu3072

Intelligence System Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submiss

原创 hdu3836之強聯通縮點

Equivalent Sets Time Limit: 12000/4000 MS (Java/Others)    Memory Limit: 104857/104857 K (Java/Others) Total Submissi

原创 hdu3669之二維斜率DP

Cross the Wall Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 327680/327680 K (Java/Others) Total Submission

原创 vue樹形組件

vue-tree vue 編寫的樹形菜單,小巧實用,支持vue1.0,vue2.0 v1.0 功能: 1.支持多級樹目錄 2.支持高亮點擊的節點 3.支持展開點擊節點 4.支持點擊收縮節點時收縮所有子目錄 5.支持自定義回調函數,點擊節點

原创 堆排序詳解

基礎排序之選擇排序 對於數組s = [2, 1, 3, 0, 4, 5, 8, 7, 6]進行升序排序 基本思路是: 雙重for循環,每次選擇最大的和最後一位數進行位置互換 for(int i = len(s) - 1; i >= 0

原创 hdu3480之二維斜率優化DP

Division Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 999999/400000 K (Java/Others) Total Submission(s):

原创 hdu3045之斜率DP

Picnic Cows Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1

原创 hdu2829之二維斜率優化DP

T. E. Lawrence was a controversial figure during World War I. He was a British officer who served in the Arabian thea

原创 快速排序詳解

圖解過程 對於數組s = [2, 1, 3, 0, 4, 5, 8, 7, 1]進行排序 將s[0]取出作爲比較值val,則s[0]位置空出 第一步,從數組右邊掃描,查詢第一個比val小的, 如圖1查詢到s[8] 將s[8]放入上一

原创 ZOJ3329之經典概率DP

One Person Game Time Limit: 1 Second      Memory Limit: 32768 KB      Special Judge There is a very simple and intere

原创 hdu4430之枚舉+二分

Yukari's Birthday Time Limit: 12000/6000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submissi

原创 hdu4455之樹狀數組+DP

Substrings Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s):