How to solve this problem without kadane's algorithm?

I have tried but i am getting error.

int main() {
int t;
cin>>t;
for(int l =0 ; l<t ; l++){
int n;
cin>>n;
int maxsum=INT_MIN;
int a[n];
for(int m = 0 ; m< n ; m++){
cin>>a[m];

	}
	for(int i=0;i<n; i++){
		int sum=a[i],j=i+1;
		while(j!=i){
	
			
			int k = i;
			
			while(k!=j){
				
				sum += a[k];
				k++;
				if(k==n){
				k=k%n;
				}	
			}
			j++;
			if(j==n){
				j=j%n;
			}
		}
		if(maxsum<sum){
			maxsum=sum;
		}

	}

	cout<<maxsum;
}
return 0;

}

hi @dhwanishshah1399_4cfa475ff75981d1 u need kadane as it will optimise the algorithm else youll need o(n3) aago for finding the max subarray sum which kadane does in o(n)

refer