From 3a1464289196109e0d00c03cfc25619ace8f539a Mon Sep 17 00:00:00 2001 From: unknown Date: Fri, 2 Oct 2020 12:46:17 +0530 Subject: [PATCH] Added solution to Max Sum Increasing Subsequence problem --- .../max_sum_increasing_subsequence.py | 26 +++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 dynamic_programming/max_sum_increasing_subsequence.py diff --git a/dynamic_programming/max_sum_increasing_subsequence.py b/dynamic_programming/max_sum_increasing_subsequence.py new file mode 100644 index 0000000..940847d --- /dev/null +++ b/dynamic_programming/max_sum_increasing_subsequence.py @@ -0,0 +1,26 @@ +# Python solution for Maximum Sum +# Increasing Subsequence problem +# using Dynamic Programming + +def maxSumIncreasingSubsqence(a, n): + maxSum = 0 + dp = [0 for x in range(n)] + + for i in range(n): + dp[i] = a[i] + + for i in range(1, n): + for j in range(i): + if(a[i] > a[j] and dp[i] < dp[j] + a[i]): + dp[i] = dp[j] + a[i] + + for i in range(n): + if maxSum < dp[i]: + maxSum = dp[i] + + return maxSum + + +a = [7, 5, 2, 10, 9 ,8, 9] +n = len(a) +print("Sum of maximum sum increasing subsequence is " + str(maxSumIncreasingSubsqence(a, n))) \ No newline at end of file