We use dynamic programming theory to design the longest common subsequence problem. We use greedy thought to design the activity scheduling problem, and compare it with different data volume.

Filename	Size	Update
Longest common subsequence\子序列.cpp	2524	2017-12-04
Longest common subsequence\活动.cpp	1688	2017-12-04
Longest common subsequence	0	2018-03-27

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．