Sir why is the first test case not matching with the solution

#1

include <bits/stdc++.h>

using namespace std;

int main () {
int t;
cin>>t;
while(t–)
{
int n; cin >>n;
int arr[1000];
int cum_sum[1000];
int max_sum=INT_MIN;

    for (int i = 0; i <n ; i++) {
        cin>>arr[i];
        if (i==0)
        {
         cum_sum[i]=arr[i];
        }
        else
        {
            cum_sum[i]=cum_sum[i-1]+arr[i];
        }
    }

    for (int i = 0; i < n; i++) {
        for (int j = i+1; j <n ; j++) {
            if ((cum_sum[i]+cum_sum[n-1]-cum_sum[j-1])>max_sum)
            {
                max_sum=(cum_sum[i]+cum_sum[n-1]-cum_sum[j-1]);
            }
        }
    }
    cout << max_sum<<endl;
}

}

#2

this approach will not work for circular arrays

for circular array use kadam’s algorithm

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.