you give array consist n integer index array start zero ie element a_0 second a_1 onyou reverse subarray continuous subsegment array Recall subarray border l r al r a_l a_l 1 dot a_ryour task reverse subarray sum element position result array maximize ie sum element a_0 a_2 dot a_2k integer k lfloorfracn12rfloor maximum possibleyou answer t independent test case