تماشای ویدئو Maximum Sum Increasing Subsequence Dynamic Programming از آی-ویدئو
Given an array, find maximum sum increasing subsequence in this array.
https://github.com/mission-peace/interview/blob/master/src/com/interview/dynamic/MaximumSumSubsequence.java
https://github.com/mission-peace/interview/wiki