ACM----【动态规划】
文章平均质量分 79
iviko
这个作者很懒,什么都没留下…
展开
-
dp_Pku1887
/*A - 简单dp 例题Time Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptionA military contractor for the Department of Defense has just completed a series o原创 2014-07-16 15:15:38 · 557 阅读 · 0 评论 -
区间Dp 暴力枚举+动态规划 Hdu1081
F - 最大子矩形Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any原创 2014-07-19 20:38:02 · 864 阅读 · 0 评论 -
B 二维背包+完全背包 Hdu2159
/* ———————————————————————————————————————————————————————————————————————————————————————————————— author : Grant Yuan time : 2014.7.19 aldorithm: 二维背包+完全背包原创 2014-07-19 16:16:36 · 733 阅读 · 0 评论 -
D 分组背包
/*—————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————— copyright : Grant Yuan time : 2014.7.18 algorithm原创 2014-07-18 19:47:56 · 688 阅读 · 0 评论 -
01背包
/*__________________________________________________________________________________________________* copyright: Grant Yuan原创 2014-07-18 12:43:04 · 648 阅读 · 0 评论 -
J Dp
/*___________________________________________________________________________________________ author : Grant Yuan time : 2014.7.18 algorithm : 最长上升子序列求和 —————原创 2014-07-18 23:09:35 · 579 阅读 · 0 评论 -
多重背包
/*__________________________________________________________________________________________________* copyright: Grant Yuan原创 2014-07-18 13:35:36 · 622 阅读 · 0 评论 -
I DP Hdu 1421
/*______________________________________________________________________________________________________ author : Grant Yuan time : 2014.7.19 algorithm : dp原创 2014-07-19 12:06:11 · 635 阅读 · 0 评论 -
G 完全背包
/*/*__________________________________________________________________________________________________* copyright: Grant Yuan原创 2014-07-18 16:44:50 · 615 阅读 · 0 评论 -
01背包+卡精度 Hdu 2955
/*————————————————————————————————————————————————————————————————————————————— author : Grant Yuan time : 2014.7.19 aldorithm: 01背包+卡精度 ——————————————————原创 2014-07-19 17:08:42 · 792 阅读 · 0 评论 -
A_完全背包
/* copyright: Grant Yuan algorithm: 完全背包 time : 2014.7.18__________________________________________________________________________________________________A - 完全背包 基础Time L原创 2014-07-18 11:53:41 · 665 阅读 · 0 评论 -
A_Dp
/*A - ¼òµ¥dp ÀýÌâTime Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptionA military contractor for the Department of Defense has just completed a seri原创 2014-07-16 21:41:21 · 588 阅读 · 0 评论 -
Dp_F Pku1157
/*F - 简单dpTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionYou want to arrange the window of your flower shop in a most pleasant way. You have原创 2014-07-16 21:18:55 · 511 阅读 · 0 评论 -
D_Dp
/*D - 简单dp 例题Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum原创 2014-07-16 21:40:07 · 696 阅读 · 0 评论 -
H_Dp
/*H - 简单dp 例题扩展Time Limit:3000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionA palindrome is a symmetrical string, that is, a string read identically from原创 2014-07-16 21:45:35 · 645 阅读 · 0 评论 -
C_Dp
/*C - 简单dp 例题Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionA subsequence of a given sequence is the given sequence with some elements (poss原创 2014-07-16 16:00:16 · 722 阅读 · 0 评论 -
B_Dp
/*B - 简单dp 例题Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmitStatusDescription73 88 1 02 7 4 44 5 2 6 5(Figure 1)Figure 1 shows a nu原创 2014-07-16 15:37:13 · 645 阅读 · 0 评论 -
区间Dp uva10755
Garbage HeapTime limit: ? secondsMemory limit: 64 megabytesFarmer John has a heap of garbage formed in a rectangular parallelepiped.It consists of garbage pieces each of which has a value. The value原创 2014-07-20 17:51:57 · 557 阅读 · 0 评论