Find the maximum sum of a subsequence with the constraint

Question

Hi..........

Ques: Now i have write the program in c# but i am not get a output please solve the problem ....
Given an array all of whose elements are positive numbers, find the maximum sum of a subsequence with the constraint that no 2 numbers in the sequence should be adjacent in the array. So 3 2 7 10 should return 13 (sum of 3 and 10) or 3 2 5 10 7 should return 15 (sum of 3, 5 and 7)

Vulpes · Answer

There's a standard algorithm for doing this in C programming - see http://www.geeksforgeeks.org/archives/3133 The C# translation would be: using System; class Program { static void Main() { int[] arr = {3 2 7 10}; Console.WriteLine(Maximum sum of array 1 is {0} FindMaxSum(arr)); int[] arr2 = {3 2 5 10 7}; Console.WriteLine(Maximum sum of array 2 is {0} FindMaxSum(arr2)); Console.ReadKey(); } static int FindMaxSum(int[] arr) { int n = arr.Length; int incl = arr[0]; int excl = 0; int excl_new; for (int i = 1; i { /* current max excluding i */ excl_new = Math.Max(incl excl); /* current max including i */ incl = excl + arr[i]; excl = excl_new; } /* return max of incl and excl */ return Math.Max(incl excl); } }