public static void main(String args[]){
        MaximumSumSubsequence mss = new MaximumSumSubsequence();
        int arr[] = {1, 101, 10, 2, 3, 100,4};
        int r = mss.maxSum(arr);
        System.out.print(r);
    }
Problem Statement:

Given an array of n positive integers. Write a program to find the sum of maximum sum subsequence of the given array
such that the integers in the subsequence are in increasing order.


Video: https://youtu.be/99ssGWhLPUE

Reference:
http://www.geeksforgeeks.org/dynamic-programming-set-14-maximum-sum-increasing-subsequence/
src/com/interview/dynamic/MaximumSumSubsequence.java