Chunky gets happy by eating Melody.
Given an array of N elements each element represent happiness chunky get by eating melody.
Chunky knows why melody is so chocolaty but will only tell you once you tell him the Max happiness he can get by eating two adjacent melodies.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case consists of two lines. First line of each test case contains an integer N and the second line contains N space separated array elements.
For each test case, print the Maximum Happiness in new line.
1 <= T <= 100
1 <= N <= 100000
-100000 <= A[i] <= 100000
1 2 3 4 5
5 2 3 4
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.