Answer to Question #306504 in C for anand

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

Input

First line of the input contains an integer T denoting the number of test cases.

The first line of each test case contains an integer N denoting the number of elements in the array. Second line contains N space-separated integers A₁, A₂, ..., A_N denoting the array A

Constraints

• 1 ≤ T ≤ 10
• 1 ≤ N ≤ 10⁵
• 0 ≤ A_i ≤ 10⁵

Input:
1
3
1 2 5
Output:
6

For the given array [1, 2, 5], there are 7 non-empty subsequences out of which there are 4 alternating subsequences. These will be {[1], [2], [5], [1, 5]}. The alternating subsequence [1, 5] will have the largest sum i.e 6.

Answer 1

#include <iostream>
using namespace std;

int main () {
  int N, A[10], T;
  int temp = 0;
  cout << "Enter the number of test cases: ";
  cin >> T;
  for (int x = 0; x < T; x++) {
    cout << "Enter the number of elements in the array:";
	cin >> N;
	cout << "Enter the elements of the array: ";
	for(int i = 0; i < N; i++) {
      cin >> A[i];
    }
	int sum = A[N-1] + A[N-2];
	cout << "Sum is: " << sum << endl;
  }
  return 0;	 
}