备忘录方法实现半数集问题的算法，C++实现代码。用c[n]保存由n产生的半数集的大小。开始时将数组c[1..n]初始化为0.表明1到n的每一个自然数所产生的半数集的大小是多少

这个问题都没被处理过 一旦检测到数组中元素c[i]的值大于零，就马上知道由自然数i产生的半数集大小是多少这个问题已经解决了且结果就在c[i]中，

而没有必要再重复计算自然数i产生的半数集大小-Ways to achieve half of the memorandum of the algorithm set problem, C++ implementation code. With c [n] save generated by n the size of half the set. Will be the beginning of the array c [1 .. n] initialized to 0. Show that every 1 to n a natural number sets generated by the size of half the number of the questions are not being dealt with　Once detected elements in the array c [ i] value is greater than zero, as soon as i know have a natural number by half the number of set size are the problem has been resolved and the result at c [i], while there is no need to repeat the calculation of the natural number i have a half set size