动态规划
wuweiwei001
我热爱编程!!!!
展开
-
动态规划2
问题:Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to you now.原创 2014-07-16 19:03:03 · 344 阅读 · 0 评论 -
动态规划入门1
问题:Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.原创 2014-07-16 17:07:35 · 470 阅读 · 0 评论 -
状态压缩
Pebbles Time Limit : 3000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 7 Accepted Submission(s) : 7Font: Times New Roman | Verdana | Georgia Font Siz原创 2014-08-06 17:16:15 · 333 阅读 · 0 评论 -
状态压缩DP
方格取数(1) Time Limit : 10000/5000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 40 Accepted Submission(s) : 17Font: Times New Roman | Verdana | Georgia Font原创 2014-08-06 17:14:44 · 358 阅读 · 0 评论 -
状态压缩DP
Doing Homework Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 12 Accepted Submission(s) : 10Font: Times New Roman | Verdana | Georgia原创 2014-08-06 17:13:50 · 279 阅读 · 0 评论 -
状态压缩
郑厂长系列故事——排兵布阵 Time Limit : 10000/5000ms (Java/Other) Memory Limit : 65535/32768K (Java/Other)Total Submission(s) : 16 Accepted Submission(s) : 4Font: Times New Roman | Verdana | Georgia原创 2014-08-06 17:22:16 · 343 阅读 · 0 评论 -
简单DP
貌似自己一点DP概念都没有啊,原创 2014-08-10 10:25:51 · 409 阅读 · 0 评论