https://leetcode.com/problems/split-array-largest-sum/\n\nInput:\n```\nn = 3\nx = [7,3,5,9,1,2]\n```\n\nYou need to split the array x into n consecutive subarrays. For example, you can split x into \n```[7,3], [5,9], [1,2] ``` or ```[7,3,5], [9], [1,2]```. But you cannot split x into ```[7,5,9], [3], [1,2]``` because ```[7,5,9]```is not consecutive.\n\nYou should output the minimum maximum sum of every subarrays.\n\nIn this case, the output is 12:\n```[7,3], [5], [9,1,2]``` or ```[7], [3,5], [9,1,2]```\n\n

https://leetcode.com/problems/split-array-largest-sum/\n\nInput:\n\nn = 3\nx = [7,3,5,9,1,2]\n\n\nYou need to split the array x into n consecutive subarrays. Fo