DP
关注
分享
扫一扫
文章平均质量分 73
huadong_fcy56
这个作者很懒，什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
zoj3211dream city dp 斜率
斜率 DP 优化代码 Dream CityJAVAMAN 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原创 2017-08-09 16:17:24 · 264 阅读 · 0 评论 -
大概是：整数划分||DP||母函数||递推
整数划分 DP 母函数 递推原创 2017-09-21 12:07:45 · 239 阅读 · 0 评论 -
HDU1085 多重背包
Holding Bin-Laden Captive!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23275 Accepted Submission(s): 10358Problem DescriptionW原创 2017-09-20 20:37:12 · 305 阅读 · 1 评论 -
1248 寒冰王座 换个思维来解决这个背包题目
顺便练习下STL和二分HDU1248#include#include#include#include#include#include#include #include#includeusing namespace std;setq;bool M[10010];int a[200],L=0;int main(){ int i,j,T,n; q.insert原创 2017-09-27 20:57:17 · 299 阅读 · 0 评论 -
HDU1223 Order Count 动态规划 组合数
动态规划+组合数+大数#include#include#include#include#include#include#include using namespace std;long long f[60][60],ans[60];long long c[60][60];int i,j;void _getc(){ for(i=0;i<=50;i++) c[i][0]=原创 2017-09-27 20:22:16 · 540 阅读 · 0 评论 -
HDU1024 DP的优化 最大M子段和问题
。原创 2017-09-12 20:48:18 · 283 阅读 · 0 评论 -
ZOJ2402 Lenny's Lucky Lotto List 简单DP
Lenny's Lucky Lotto ListsTime Limit: 2 Seconds Memory Limit:65536 KB 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原创 2017-08-22 14:35:56 · 292 阅读 · 0 评论 -
ZOJ2401 Zipper 双塔式 DP
遇到双塔DP，写一下。flag是为了避免memset。 #include#include#include#includeusing namespace std;char x[410],y[410],z[410];int map[410][410],L,Lx;//410=210+x bool _find(int flag){ for(int i=1;i<=L;i++) {原创 2017-08-21 20:13:25 · 242 阅读 · 0 评论 -
ZOJ2067 经典 DP
题目：一个由‘.’和‘#’组成矩形，统计里面'.'组成的矩形的个数。点击打开链接自己写挂了，懒得搞了#include #include #define MAX 110#define inf 0x7fffffffchar a[MAX][MAX];int count[MAX][MAX];int n;int min(int x,int y){ return x<y?x:y;原创 2017-08-19 18:41:08 · 222 阅读 · 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 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1原创 2017-08-13 12:18:14 · 278 阅读 · 0 评论 -
zoj 1108 FatMouse's Speed 基础dp
FatMouse's Speed FatMouse believes that the fatter a mouse is, the faster it runs. To disprove this, you want to take t原创 2017-08-12 14:54:07 · 383 阅读 · 0 评论 -
ZOJ 2042 Divisibility (DP)
DivisibilityTime Limit: 2 Seconds Memory Limit:65536 KB Consider an arbitrary sequence of integers. One can place + or - operators between integers in the sequence, thus deriving diff原创 2017-08-10 22:40:07 · 238 阅读 · 0 评论 -
zoj 1539 Lot 简单DP 记忆化
LotTime Limit: 2 Seconds Memory Limit:65536 KB 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 o原创 2017-08-10 19:41:22 · 463 阅读 · 0 评论 -
HDU1081 最大字段和 压缩数组
HDU1081 最大字段和 压缩数组原创 2017-09-17 20:49:40 · 267 阅读 · 0 评论