Java program to find maximum sum increasing subsequence tiint i - th index and including k - th index .
class GFG { static int pre_compute ( int a [ ] , int n , int index , int k ) { int dp [ ] [ ] = new int [ n ] [ n ] ;