单选题：Which one of the following problems can be best solved by dynami

Which one of the following problems can be best solved by dynamic programming? @[D](1)

A. Mergesort
B. Closest pair of points problem
C. Quicksort
D. Longest common subsequence problem




A.Mergesort
B.Closest pair of points problem
C.Quicksort
D.Longest common subsequence problem


答案：D