![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
动态规划
文章平均质量分 76
一朵风中摇曳的程序媛
这个作者很懒,什么都没留下…
展开
-
POJ 2533 Longest Ordered Subsequence
Longest Ordered SubsequenceTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 59959 Accepted: 26861DescriptionA numeric sequence of ai is ordered if a1 <...原创 2018-04-24 08:56:58 · 133 阅读 · 0 评论 -
POJ 2533 Longest Ordered Subsequence
Longest Ordered SubsequenceTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 59959 Accepted: 26861DescriptionA numeric sequence of ai is ordered if a1 &l...原创 2018-04-24 09:01:13 · 130 阅读 · 0 评论 -
0/1背包问题
0/1背包问题:给定背包的最大承重总量,每一个物品的重量为w[i],价值为c[i]。问在承重范围内能装下的最大价值为多少。代码:#include<stdio.h>#include<algorithm>#define N 1005using namespace std;int f[N][N], w[N], c[N];int main(void){ int m,...原创 2018-04-24 13:43:07 · 216 阅读 · 0 评论 -
SDNUOJ 1033 采药
1033.采药 Time Limit: 1000 MS Memory Li...原创 2018-04-24 16:41:39 · 303 阅读 · 0 评论