作品：算法设计课程作业

作者：陈兴

学号：J04120010





操作说明：

1、最长公共子序列：

用VC6.0打开文件以后输入一串数字，按“\\”为结束，输出结果。

2、背包问题

用vc6.0打开文件以后按提示操作。

3、残缺棋盘问题

用vc6.0打开文件以后按提示操作。

4、（3.1和3.2还有3.3）

这个是课本82页的作业，基本实现了。其中3.2的算法时间复杂度不是nlogn而是n，nlogn的算法没做出来！



-entries : algorithm design courses operating Author : Bernadette school : J04120010 instructions : 1. Public longest sequences : VC6.0 open the file after importing a bunch of numbers, "\\" to the end, and the output results. 2, knapsack problem with open files after vc6.0 suggested by the operation. 3, incomplete chessboard problems with open files after vc6.0 suggested by the operators. 4, (3.1 and 3.2 have 3.3) This is a textbook 82 operations, the basic reality. 3.2 which time the algorithm complexity is not nlogn but n, nlogn algorithm never come out!