DP - 随笔分类(第9页) - nimphy

ZOJ2402 Lenny's Lucky Lotto List 简单DP

摘要：Lenny likes to play the game of lotto. In the lotto game, he picks a list of N unique numbers in the range from 1 to M. If his list matches the list o 阅读全文

posted @ 2017-09-27 21:06 nimphy 阅读(215) 评论(0) 推荐(0)

ZOJ2401 Zipper 双塔式 DP（双塔DP）

摘要：第二次遇到双塔DP，再写一下。（flag是为了避免memset多次导致的时间浪费） #include<cstdio> #include<cstdlib> #include<iostream> #include<cstring> using namespace std; char x[410],y[ 阅读全文

posted @ 2017-09-27 21:06 nimphy 阅读(403) 评论(0) 推荐(0)

ZOJ2067 经典 DP（单调队列优化）

摘要：题目：一个由‘.’和‘#’组成矩形，统计里面'.'组成的矩形的个数。点击打开链接自己写挂了，懒得搞了阅读全文

posted @ 2017-09-27 21:06 nimphy 阅读(200) 评论(0) 推荐(0)

zoj 2136 Longest Ordered Subsequence 最长上升子序列新思路

摘要：Longest Ordered SubsequenceTime Limit: 2 Seconds Memory Limit:65536 KB A numeric sequence of ai is ordered if a1 #include#include#includeusing na... 阅读全文

posted @ 2017-09-27 21:06 nimphy 阅读(128) 评论(0) 推荐(0)

zoj 1108 FatMouse's Speed 基础dp

摘要：FatMouse's SpeedTime Limit: 2 Seconds Memory Limit:65536 KB Special Judge FatMouse believes that the fatter a mouse is, the faster it runs. To disprov 阅读全文

posted @ 2017-09-27 21:06 nimphy 阅读(249) 评论(0) 推荐(0)

ZOJ 2042 Divisibility (DP)

摘要：Consider an arbitrary sequence of integers. One can place + or - operators between integers in the sequence, thus deriving different arithmetical expr 阅读全文

posted @ 2017-09-27 21:06 nimphy 阅读(150) 评论(0) 推荐(0)

zoj 1539 Lot 简单DP 记忆化

摘要：Out of N soldiers, standing in one line, it is required to choose several to send them scouting. In order to do that, the following operation is perfo 阅读全文

posted @ 2017-09-27 21:06 nimphy 阅读(246) 评论(0) 推荐(0)

ZOJ 3211dream city dp（效率优化）

摘要：JAVAMAN is visiting Dream City and he sees a yard of gold coin trees. There aren trees in the yard. Let's call them tree 1, tree 2 ...and treen. At th 阅读全文

posted @ 2017-09-27 21:06 nimphy 阅读(129) 评论(0) 推荐(0)

HDU1223 Order Count 动态规划组合数

摘要：Order Count Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 954 Accepted Submission(s): 371 Probl 阅读全文

posted @ 2017-09-27 21:06 nimphy 阅读(1181) 评论(2) 推荐(0)

---学习ing---

学习ing、创业ing

随笔分类 - DP