Maximum Length Even Subarray solution codechef
You are given an integer. Consider the sequence containing the integers in increasing order (each exactly once). Find the maximum length of its contiguous subsequence with an even sum.
- The first line of the input contains a single integer denoting the number of test cases. The description of test cases follows.
- The first and only line of each test case contains a single integer .
Output Format Maximum Length Even Subarray solution codechef
For each test case, print a single line containing one integer — the maximum length of a contiguous subsequence with even sum.
Subtask #1 (100 points): original constraints
Sample Input 1 Maximum Length Even Subarray solution codechef
3 3 4 5
Sample Output 1
3 4 4
Explanation Maximum Length Even Subarray solution codechef
Example case 1: The optimal choice is to choose the entire sequence, since the sum of all its elements is, which is even.
Example case 3: One of the optimal choices is to choose the subsequence, which has an even sum.