For this Question: Given an array, A of length N, find the contiguous subarray within A which has the largest sum.First line of each test case contain the number of test cases.
The first line of each test case contains an integer n, the length of the array A
 and the next line contains n integers.

Constraints:
1<=T<=100
1 <= N <= 10^5
-10^6 <= A[i] <= 10^6Output an integer representing the maximum possible sum of the contiguous subarray.Input:
1
5
1 2 3 4 -10

Output:
10

Explanation:-
1+2+3+4=10, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
long long Sum(long  long a[], int size)
{
    long long max_so_far = INT_MIN, max_ending_here = 0;

    for (int i = 0; i < size; i++)
    {
        max_ending_here = max_ending_here + a[i];
        if (max_so_far < max_ending_here)
            max_so_far = max_ending_here;

        if (max_ending_here < 0)
            max_ending_here = 0;
    }
    return max_so_far;
}

int main(){

        

int t;
cin>>t;

while(t--){
    int n;
    cin>>n;
    long long a[n];
    for(int i=0;i<n;i++){
        cin>>a[i];
    }



      cout<<Sum(a,n)<<endl;


    }




}
, In this Programming Language: C++, Now tell me if this Code is compilable or not?