MAXIMUM SUBARRAY SUM
You are given a one dimensional array that may contain both positive and negative integers, find the sum of contiguous subarray of numbers which has the largest sum. For example, if the given array is {-2, -5, 6, -2, -3, 1, 5, -6}, then the maximum subarray sum is 7.
Input Format:
The first line consists of number of test cases T. Each test case consists of N followed by N integers.
Sample Input
2
4
1 2 3 4
3
-10 5 10
here I know the code for maximum subarray sum and if we take no. of test cases then how I should store multiple arrays for multiple testcases.