Location:
Search - maxm
Search list
Description: 给定由n 个整数(可能为负整数)组成的序列1 a ， 2 a ，…， n a ，以及一个正整数m，要
求确定序列1 a ， 2 a ，…， n a 的m 个不相交子段，使这m 个子段的总和达到最大。-given by n integers (with the possible negative integers) consisting of a sequence of 1, a 2, ..., n a, and a positive integer m, a request to determine a sequence, a 2, ..., n m of a non-intersection, so that the m height of the sum of the maximum.
Platform: |
Size: 812 |
Author: lxq |
Hits:
Description: 给定由n 个整数(可能为负整数)组成的序列1 a ， 2 a ，…， n a ，以及一个正整数m，要
求确定序列1 a ， 2 a ，…， n a 的m 个不相交子段，使这m 个子段的总和达到最大。-given by n integers (with the possible negative integers) consisting of a sequence of 1, a 2, ..., n a, and a positive integer m, a request to determine a sequence, a 2, ..., n m of a non-intersection, so that the m height of the sum of the maximum.
Platform: |
Size: 1024 |
Author: lxq |
Hits:
Description: 一个自己编写的这次2008北京市电子竞赛VHDL源程序-I have written one of the 2008 competition in Beijing e-VHDL source
Platform: |
Size: 1246208 |
Author: fspigfspig |
Hits:
Description: It is a knapsack problem.In wic we have profit and corresponding weights.We have a knapsack value in weight.We will take weights according to that way that profit should be maxm.This code ll give yuh that optimal profit.
Platform: |
Size: 1024 |
Author: Nevla |
Hits:
Description: infineon英飞凌2000系列详细PDF资料，学习英飞凌的好资料-Infineon 2000 series detailed answers PDF material, study the good material answers
Platform: |
Size: 1491968 |
Author: kaesar |
Hits:
Description: XC2000 系列及变种基本系统功能使用-XC2000 Family Derivatives
Handling of Basic System Functions
Platform: |
Size: 1492992 |
Author: bobo |
Hits: