MAXIMUM SUBARRAY SUM with kadane algo

#1

#include
using namespace std;

int main()
{
int t, n, a[100000000];
cin>>t;
while(t–)
{
cin>>n;
for(int i=0; i<n; i++)
{
cin>>a[i];
}

    //kadanes algo
    int current_sum =0, max_sum = 0;
    for(int i=0; i<n; i++)
    {
        current_sum = current_sum + a[i];
        if(current_sum < 0)
        {
            current_sum = 0;
        }
        max_sum = max(max_sum, current_sum);
    }
    cout<<max_sum<<endl;
}
return 0;

}