Dynamic-Programing
文章平均质量分 76
Dwylkz
no best, but coordination
展开
-
HDU 2571 命运
命运 Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 9 Accepted Submission(s) : 4Font:原创 2011-07-20 14:39:21 · 435 阅读 · 0 评论 -
HDU 4670 Cube number on a tree
divide and conquer on tree.#include #include #include #include #include #include using namespace std;const int N = 5e4+10;const int K = 32;typedef long long LL;struct edge_t { int v, to原创 2013-08-16 13:50:19 · 779 阅读 · 0 评论 -
HDU 4679 Terrorist’s destroy
for each tree u, maintain five stuff: p: the longest upper path start from u . h: the diameter of the global tree after cut tree u. f: the diameter of tree u. d[0]: the longest lower path原创 2013-08-16 14:05:40 · 655 阅读 · 0 评论 -
HDU 4625 JZPTREE
蛋疼的,斯特林数优化+小树形递推原创 2013-08-04 20:45:19 · 2589 阅读 · 0 评论 -
UVALive 4236 Text Messaging Improvement?
http://livearchive.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2237dp[i as i-th frequency(or letter)][j as we had used j key][k as the k-th position in原创 2012-08-19 09:31:48 · 1156 阅读 · 3 评论 -
hdu 4285 circuits
/* Damn it! I should deal with this SCDP instead of Problem 1003, And I make a big mistake, I should read all the problem first! Errrr........... According to the statement, we can only have K-l原创 2012-09-13 09:06:10 · 692 阅读 · 0 评论 -
hdu 4258 Covered Walkway
/*Intuitively, according to the declaration of the problem, we haveDefinition s[i] as the coordinate ith point need to be covered. dp[i] as the minimum cost to cover the walkway within [0, i],原创 2012-09-06 17:19:36 · 639 阅读 · 0 评论 -
pku 2096 Collecting Bugs
/* Definition: 1. st[i, j] as we have found i categories and j subsystems. 2. ev[i, j] as the expected move from st[i, j] to st[n, s]. According to the statement of the problem, we can get ev[原创 2012-09-05 15:07:39 · 561 阅读 · 0 评论 -
hdu 4219 Randomization?
What a disgusting tree type probability dp!But it cant annoy me anymore hoho :).dp[u][i] as the probability that (1) The height of subtree u is i (2) The distance between any two nodes do not exc原创 2012-08-22 12:09:02 · 672 阅读 · 0 评论 -
hdu 4031 Divide Chocolate
Dynamic Programming again!There are a lot of state, so, the main point is how to classify them clearly.dp[i][j][0]: as the number of different methods to divide 2 * i chocolate grid into j part an原创 2012-08-23 13:18:55 · 570 阅读 · 0 评论 -
hdu 4340 Capturing a country
f for Af[u][0] as the min-time to conquer subtree u, u-th city is conquered by A and the start node of all the most nearly continuous-conquer path from each son had not been considered yetf[u][1]原创 2012-08-19 10:39:16 · 455 阅读 · 0 评论 -
UVALive 4614 Moving to Nuremberg
http://livearchive.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2615DFS twicethe first DFSthe dp[u] as the time that edge[father][u] had been usedsum原创 2012-08-19 10:13:42 · 735 阅读 · 0 评论 -
UVALive 4302 Toll Road
http://livearchive.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2303dp[u]: as the maximum value connected component include usoif (dp[v] + w > 0) dp[u]原创 2012-08-19 09:42:24 · 810 阅读 · 1 评论 -
UVALive 4235 Recursively Palindromic Partitions
http://livearchive.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2236dp[i]: as i has dp[i] RPPand dp[i] = dp[i / 2] + $\sum_{j = 1}^{i}dp[(n - i) / 2]$原创 2012-08-19 09:13:24 · 785 阅读 · 0 评论 -
Ural 1519 Formula 1
1519. Formula 1Time Limit: 1.0 secondMemory Limit: 16 MBBackgroundRegardless of the fact, that Vologda could not get rights to hol原创 2011-10-05 20:10:16 · 1526 阅读 · 0 评论 -
HDU 2151 Worm
WormTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1420 Accepted Submission(原创 2011-08-01 20:48:50 · 682 阅读 · 0 评论 -
HDU 1159 Common Subsequence
Common SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8893 Accepted S原创 2011-07-20 16:00:09 · 1017 阅读 · 0 评论 -
HDU 2571 命运 .
命运 Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 9 Accepted Submission(s) : 4Font: Times New Roman | Verdana | Georgia Font Size: ← →...2011-07-31 20:02:08 · 102 阅读 · 0 评论