#include <iostream> using namespace std; int arr[50005]; int opt1[50005]; int temp; int opt2[50005]; int main() { int N; scanf("%d", &N); while(N--) { int n; scanf("%d", &n); for(int i = 0; i < n; ++i) scanf("%d", &arr[i]); opt1[0] = arr[0]; temp = arr[0]; for(int i = 1; i < n; ++i) { temp = max(arr[i], temp+arr[i]); opt1[i] = max(temp, opt1[i-1]); } opt2[n-1] = arr[n-1]; temp = arr[n-1]; for (int i = n-2; i >= 0; --i) { temp = max(arr[i], temp+arr[i]); opt2[i] = max(temp, opt2[i+1]); } int nMax = opt1[0]+opt2[1]; for(int i = 1; i < n-1; ++i) if(opt1[i] + opt2[i+1] > nMax) nMax = opt1[i] + opt2[i+1]; printf("%d/n", nMax); } return 0; }