Answer to Question #311500 in C++ for xyz

Question

You are given an array of N non-negative integers: A₁, A₂, ..., A_N. An alternating subsequence is a subsequence in which the indices of any two consecutive elements differ by exactly two in the original array. That is, if A_i1, A_i2, ..., A_ik is some subsequence, then for it to be an alternating subsequence, (i₂ - i₁ = 2), (i₃ - i₂ = 2), and so on should all hold true. Among all alternating subsequences, find the one which has maximum sum of elements, and output that sum.

Answer 1

Here is my program:

int main()
{
	int const size = 5;
	int N[size]{3,5,3,1,20};
	int sum = 0;
	for (int i = 4; i >= 0 ; i--)
	{
		if (i == 0)
		{
			break;
		}
		sum += N[i] - N[i - 1];
		
	}
	cout << "Sum = "<< sum << endl;
}