原创 zoj 3329 One Person Game(概率dp,期望)

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

原创 zoj 2676 Network Wars(01分數規劃+最小割)

Network Wars     Time Limit: 5 Seconds      Memory Limit: 32768 KB      Special Judge   Network of Byteland consists

原创 zoj 3229 Shoot the Bullet(有源匯上下界最大流)

Shoot the Bullet Time Limit: 2 Seconds      Memory Limit: 32768 KB      Special Judge Gensokyo is a world which exist

原创 zoj 2243 Binary Search Heap Construction(笛卡爾樹)

Binary Search Heap Construction Time Limit: 5 Seconds      Memory Limit: 32768 KB Read the statement of problem G for

原创 hdu 1724 Ellipse(Simpson積分法)

Ellipse Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1152  

原创 poj 3294 Life Forms(不小於k 個字符串中的最長子串)

 Life Forms Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 9941   Accepted: 2740 Description You may

原创 poj 1743 Musical Theme(不可重疊最長重複子串)

Musical Theme Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 19435   Accepted: 6650 Description A mus

原创 spoj 694 Distinct Substrings(不相同的子串的個數)

Distinct Substrings Time Limit: 159MS   Memory Limit: Unknown   64bit IO Format: %lld & %llu Submit Status Descrip

原创 poj 2774 Long Long Message(最長公共子串)

Long Long Message Time Limit: 4000MS   Memory Limit: 131072K Total Submissions: 21724   Accepted: 8918 Case Time Limi

原创 poj 3155 Hard Life(最大密度子圖)

Hard Life Time Limit: 8000MS   Memory Limit: 65536K Total Submissions: 6908   Accepted: 1998 Case Time Limit: 2000MS

原创 poj 3261 Milk Patterns(可重疊的k 次最長重複子串)

Milk Patterns Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 10676   Accepted: 4792 Case Time Limit: 20

原创 最小生成樹計數(Kruskal+Matrix-Tree定理)

以下轉載自:http://blog.csdn.net/jarily/article/details/8902402 /* *算法引入: *給定一個含有N個結點M條邊的無向圖,求它最小生成樹的個數t(G); * *算法思想: *

原创 hdu 3663 Power Stations(精確覆蓋 Dancing Links 模版)

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

原创 poj 3740 Easy Finding(Dancing Links 精確覆蓋)

Easy Finding Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 16128   Accepted: 4321 Description Given a

原创 生成樹計數(Matrix-Tree定理)

以下轉載自http://blog.csdn.net/jarily/article/details/8901363 /* *算法引入: *給定一個無向圖G,求它生成樹的個數t(G); * *算法思想: *(1)G的度數矩陣D[G