包括GRAY码，工作分配问题，会场安排，石子，行数字三角形，最长递增子序列和最小重量机器算法。利用动态规划、回溯法和贪心法-including GRAY code, work assignment, venue arrangements, gravel, and digital triangle, the longest sequences and increase the minimum weight machine algorithm. Using dynamic programming,

LCS 最长公共子序列 C代码实现 随机生成小于等于n的自然数的一个序列，输出其最长递增子序列（任意一个即可）。-Longest Common Sequence realized by C

针对最长递增子序列问题的解决方法及相应源程序-Solution for the longest increasing subsequence problem and the corresponding source code