{"id":26227,"date":"2017-10-26T20:31:21","date_gmt":"2017-10-26T15:01:21","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=26227"},"modified":"2017-10-26T20:31:21","modified_gmt":"2017-10-26T15:01:21","slug":"c-programming-maximum-sum-increasing-subsequence-2","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/c-programming-maximum-sum-increasing-subsequence-2\/","title":{"rendered":"Cpp Programming &#8211; Maximum Sum Increasing Subsequence"},"content":{"rendered":"<p>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 intgers in the subsequence are sorted in increasing order.<span id=\"more-19248\"><\/span> For example, if input is {1, 101, 2, 3, 100, 4, 5}, then output should be 106 (1 + 2 + 3 + 100), if the input array is {3, 4, 5, 10}, then output should be 22 (3 + 4 + 5 + 10) and if the input array is {10, 5, 4, 3}, then output should be 10<\/p>\n<p><strong>Solution<\/strong><br \/>\nThis problem is a variation of standard Longest Increasing Subsequence (LIS) problem. We need a slight change in the Dynamic Programming solution of LIS problem. All we need to change is to use sum as a criteria instead of length of increasing subsequence.<\/p>\n<p>Following are C++ implementations for Dynamic Programming solution of the problem.<\/p>\n[pastacode lang=\u201dcpp\u201d manual=\u201d%2F*%20Dynamic%20Programming%20implementation%20of%20Maximum%20Sum%20Increasing%0ASubsequence%20(MSIS)%20problem%20*%2F%0A%23include%3Cstdio.h%3E%0A%20%0A%2F*%20maxSumIS()%20returns%20the%20maximum%20sum%20of%20increasing%20subsequence%0A%20%20%20%20in%20arr%5B%5D%20of%20size%20n%20*%2F%0Aint%20maxSumIS(%20int%20arr%5B%5D%2C%20int%20n%20)%0A%7B%0A%20%20%20%20int%20i%2C%20j%2C%20max%20%3D%200%3B%0A%20%20%20%20int%20msis%5Bn%5D%3B%0A%20%0A%20%20%20%20%2F*%20Initialize%20msis%20values%20for%20all%20indexes%20*%2F%0A%20%20%20%20for%20(%20i%20%3D%200%3B%20i%20%3C%20n%3B%20i%2B%2B%20)%0A%20%20%20%20%20%20%20%20msis%5Bi%5D%20%3D%20arr%5Bi%5D%3B%0A%20%0A%20%20%20%20%2F*%20Compute%20maximum%20sum%20values%20in%20bottom%20up%20manner%20*%2F%0A%20%20%20%20for%20(%20i%20%3D%201%3B%20i%20%3C%20n%3B%20i%2B%2B%20)%0A%20%20%20%20%20%20%20%20for%20(%20j%20%3D%200%3B%20j%20%3C%20i%3B%20j%2B%2B%20)%0A%20%20%20%20%20%20%20%20%20%20%20%20if%20(%20arr%5Bi%5D%20%3E%20arr%5Bj%5D%20%26%26%20msis%5Bi%5D%20%3C%20msis%5Bj%5D%20%2B%20arr%5Bi%5D)%0A%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20msis%5Bi%5D%20%3D%20msis%5Bj%5D%20%2B%20arr%5Bi%5D%3B%0A%20%0A%20%20%20%20%2F*%20Pick%20maximum%20of%20all%20msis%20values%20*%2F%0A%20%20%20%20for%20(%20i%20%3D%200%3B%20i%20%3C%20n%3B%20i%2B%2B%20)%0A%20%20%20%20%20%20%20%20if%20(%20max%20%3C%20msis%5Bi%5D%20)%0A%20%20%20%20%20%20%20%20%20%20%20%20max%20%3D%20msis%5Bi%5D%3B%0A%20%0A%20%20%20%20return%20max%3B%0A%7D%0A%20%0A%2F*%20Driver%20program%20to%20test%20above%20function%20*%2F%0Aint%20main()%0A%7B%0A%20%20%20%20int%20arr%5B%5D%20%3D%20%7B1%2C%20101%2C%202%2C%203%2C%20100%2C%204%2C%205%7D%3B%0A%20%20%20%20int%20n%20%3D%20sizeof(arr)%2Fsizeof(arr%5B0%5D)%3B%0A%20%20%20%20printf(%22Sum%20of%20maximum%20sum%20increasing%20subsequence%20is%20%25d%5Cn%22%2C%0A%20%20%20%20%20%20%20%20%20%20%20maxSumIS(%20arr%2C%20n%20)%20)%3B%0A%20%20%20%20return%200%3B%0A%7D\u201d message=\u201dC++\u201d highlight=\u201d\u201d provider=\u201dmanual\u201d\/]\n<p>Output:<\/p>\n<pre>Sum of maximum sum increasing subsequence is 106<\/pre>\n<p>Time Complexity: O(n^2)<\/p>\n[ad type=\u201dbanner\u201d]\n","protected":false},"excerpt":{"rendered":"<p>C++ Programming &#8211; Maximum Sum Increasing Subsequence &#8211; Dynamic Programming Given an array of n positive integers. To find the sum of maximum sum <\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[69969,83515,1,70145],"tags":[72847,72842,72845,70483,72841,72848,72840,72849,72846,72843,72854,77933,72844,72850,72839,77941,77935,77934,77932,77928,77929,77931,77942,77936,77937,77927,72852,72855,72853,72851],"class_list":["post-26227","post","type-post","status-publish","format-standard","hentry","category-algorithm","category-c-programming-3","category-coding","category-dynamic-programming","tag-concept-of-dynamic-programming","tag-define-dynamic-programming","tag-definition-of-dynamic-programming","tag-dynamic-programming","tag-dynamic-programming-c","tag-dynamic-programming-code-generation-algorithm","tag-dynamic-programming-definition","tag-dynamic-programming-in-c","tag-dynamic-programming-in-data-structure","tag-dynamic-programming-problems","tag-dynamic-programming-set-1","tag-dynamic-programming-set-15","tag-dynamic-programming-software","tag-explain-dynamic-programming","tag-how-to-solve-dynamic-programming-problems","tag-increasing-subsequence-with-maximum-sum-in-c-code","tag-largest-sum-non-contiguous-subarray","tag-maximum-increasing-subsequence","tag-maximum-subsequence-sum","tag-maximum-sum-alternating-subsequence","tag-maximum-sum-increasing-subsequence-dynamic-programming","tag-maximum-sum-increasing-subsequence-nlogn","tag-maximum-sum-subarray-divide-and-conquer-in-c-code","tag-maximum-sum-subarray-dynamic-programming","tag-maximum-sum-subsequence-dynamic-programming","tag-printing-maximum-sum-increasing-subsequence","tag-problems-on-dynamic-programming","tag-simple-dynamic-programming-example","tag-types-of-dynamic-programming","tag-youtube-dynamic-programming"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26227","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=26227"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26227\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=26227"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=26227"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=26227"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}