文件名称:SumOfSub
介绍说明--下载内容均来自于网络,请自行研究使用
给定一个正整数的集合,子集和问题要求在这个正整数集合中,找出其和不超过正整数C的最大和数的子集,且设计的算法是基于近似算法的基本思想。-Given a set of positive integers, a subset of the requirements and problems in this set of positive integers, to find out and no more than the largest positive integer C, a subset of several, and the design of the algorithm is based on the basic idea of approximation algorithms.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
sy8.cpp
实验8.doc
实验8.doc