搜索资源列表
maxm
- 给定由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
maxm
- 给定由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
maxmin
- 一个自己编写的这次2008北京市电子竞赛VHDL源程序-I have written one of the 2008 competition in Beijing e-VHDL source
knap_sor
- 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.
xc2000[MAXM]_pg_v1.0_2008_07
- infineon英飞凌2000系列详细PDF资料，学习英飞凌的好资料-Infineon 2000 series detailed answers PDF material, study the good material answers
xc2000[MAXM]_pg_v1.0_2008_07
- XC2000 系列及变种基本系统功能使用-XC2000 Family Derivatives Handling of Basic System Functions