Firends can u give answers for this question its urjent. suppose you are given an array of int. for example A[ ] = {1, - 1, 3, 8 ,4 } maximize the sum of subset such that if you include the number in sum, you may not use adjutant numbers to count in sum. so in the example above the max sum is 1+ 8 = 9; in A[ ] = { 1, 5, 3, 9, 4 } the max sum is 5 + 9 = 14. and in A[ ] = { 1,2,3,4, 5} max sum i s 1 + 3 + 5 = 9
Posted on: Thu, 06 Jun 2013 07:10:18 +0000
Trending Topics
Recently Viewed Topics
© 2015