What is the problem with my code?

#1 
#include<iostream>
#include<climits>
using namespace std;
void maxcircular()
{
    int n;
    cin>>n;
    int a[10000]={0};
    for (int i = 0; i < n; i++)
    {
        cin>>a[i];
    }
    int largest_sum=INT_MIN;
    int  curr=0;
    int k=0;
    int maxsum=INT_MIN;
    while (k<n)
    { 
    for ( int i=k ; i < n; i++)
    {
        if (curr+a[i]>=0)
       {
           curr+=a[i];
       }
       else
       {
           curr=0;
       }
       largest_sum=max(curr,largest_sum);
    }
    if (k!=0)
    {
        for ( int i=0 ; i < k; i++)
    {
        if (curr+a[i]>=0)
       {
           curr+=a[i];
       }
       else
       {
           curr=0;
       }
       largest_sum=max(curr,largest_sum);
    }
    }
    maxsum=max(largest_sum,maxsum);
    largest_sum=INT_MIN;
    curr=0;
    k++;
    }
    cout<<maxsum;
}
int main(){
    int t;
    cin>>t;
    while (t)
    {
        maxcircular();
        t--;
    }
    
    return 0;
}
#2

hello @sagar_aggarwal
i m not getting ur approach , can u please explain.

#3

Thanks aman but i solved this there was a endl missing when i was printing the ans.

#4

ok,
read editorial as well for O(n) solution

#5

i used kadanes approch is there any better approch ?

#6

no they will use kadane only but they have used some trick to reduce the time complexity.

#7

ok can you provide link to editorial? please

#8

click on solution tab , there u will get it