hdu 4006 The kth great number (優先隊列+STB+最小堆) The kth great number Time Limit:
zoj2297Survival (狀態壓縮DP) Survival Time Limit: 5 Seconds Memory Limit: 32768
poj2528--Mayor's posters(線段樹+離散化) Mayors posters Time Limit: 1000M
[ACM] hdu 3555 Bomb (數位DP,統計1-N中含有“49”的總數) Bomb Time Limit: 2000/1000 MS (Ja
Leetcode--Recover Binary Search Tree Problem Description: Two elements of a
uva 1500 - Alice and Bob(推理) 題目連接:uva 1500 - Alice and Bob 題目大意:在黑板上又一個序列,每次
POJ 1177 Picture(掃描線求周長) 與求面積並的差不多,但是這個與掃描的方向相同的情況不太好處理,如果掃描線離散化兩次掃兩遍其實也可以解決這個
hdu 4763 Theme Section (簡單KMP) Theme Section Time Limit: 2000/1000 MS (Java/
POJ - 1780 Code (歐拉回路+手寫DFS) Description KEY Inc., the leading company in sec
UVA 716 - Commedia dell' arte(三維N數碼問題) UVA 716 - Commedia dell arte
MappedByteBuffer高速緩存文件、RandomAccessFile隨機訪問 說到高速緩存存儲,處理讀寫文件,那就不得不說MappedByteBu
Leetcode--Generate Parentheses Problem Description: Given n pairs of parenth