LCS: The longest common place or the sequential sequence in each sequential sequence is a sequence that appears in the same order, but not necessarily continuously. Fractional Knapsack: Given the weight and value of the n items, these items need to place the bag at the maximum opportunity W sum value to enter the bag. 0-1 on the knapsack problem that can not be allowed to break items. Are all items taken or taken away