TLE WHILE SUBMITTING

[mverma_be19 (MANAH VERMA)]

Coding Blocks IDE

[asaurabh_26 (logical coder)]

Constraints

1 <= N <= 100000

1 <= t <= 20

-100000000 <= A[i] <= 100000000

look at constraints n is of the order 10^5
and your code time complexity is O(n^3) which will definitely give tle

you can solve this question using kadane’s algorithm

for kadanes algorithm see this

How to solve this problem(Maximum circular sum)

approach is using kadan’s algorithm for circular subarray There can be two cases for the maximum sum: Case 1: The elements that contribute to the maximum sum are arranged such that no wrapping is there. Examples: {-10, 2, -1, 5}, {-2, 4, -1, 4, -1}. In this case, Kadane’s algorithm will produce the result. Case 2: The elements which contribute to the maximum sum are arranged such that wrapping is there. Examples: {10, -12, 11}, {12, -5, 4, -8, 11}. In this case, we change wrapping to non-wr…

i have explained this

if you want to ask something about this feel free to ask here
i hope this helps
if yes show your response with and don’t forgot to mark doubt as resolved

[mverma_be19 (MANAH VERMA)]

https://ide.codingblocks.com/s/307585 Giving incorrect output. Please check

[asaurabh_26 (logical coder)]

initially you have to set ms as int_min and cs to 0

int T,N,ms=INT_MIN,cs=0;

after that it will give correct outpout