class Solution {
public:int splitArray(vector<int>& nums, int m) {int n=nums.size();// sum[i] - sum of first i itemsvector<long> sum(n+1,0);for (int i=1;i<=n;++i){sum[i] = sum[i-1]+nums[i-1];}vector<vector<long>> memo(n,vector<long>(m+1,-1));return dfs(0,m,nums,sum,memo);}// start - start indexlong dfs(int start, int m, vector<int> &nums, vector<long> &sum, vector<vector<long>> &memo){if (m==1) return sum[nums.size()]-sum[start];if (memo[start][m]!=-1) return memo[start][m];long minmax=LONG_MAX;for (int i=start+1;i<nums.size();++i){minmax = min(minmax, max(sum[i]-sum[start], dfs(i,m-1,nums,sum,memo)));}return memo[start][m]=minmax;}
};

class Solution {
public:int splitArray(vector<int>& nums, int m) {int n=nums.size();// dp[i][j] - the minmax value of dividing first i items into j parts// dp[0][j] = INT_MAX,  dp[i][1] = sum[i];// dp[i][j] = min_k max(dp[k][j-1], a[k]+...+a[i-1])  (0<=k<i)vector<vector<long>> dp(n+1,vector<long>(m+1,INT_MAX));// sum[i] - sum of first i itemsvector<long> sum(n+1,0);for (int i=1;i<=n;++i){sum[i] = sum[i-1]+nums[i-1];}dp[0][0] = 0;for (int i=1;i<=n;++i){for (int j=1;j<=m;++j){for (int k=0;k<i;++k){dp[i][j] = min(dp[i][j], max(dp[k][j-1], sum[i]-sum[k]));}}}return dp[n][m];}
};

class Solution {
public:int splitArray(vector<int>& nums, int m) {long low=0, high=0;for (long num:nums){low = max(low,num);high += num;}while (low<high){long mid=(low+high)/2;if (canSplit(mid,nums,m))high = mid;elselow = mid+1;}return low;}bool canSplit(long cap, vector<int> &nums, int m){int count=1;long sum=0;for (int num:nums){sum += num;if (sum>cap){++count;if (count>m) return false;sum = num;}}return true;}
};