leetcode410 Split Array Largest Sum

思路：

dp。

实现：

 class Solution
 {
 public:
     int splitArray(vector<int>& nums, int m)
     {
         int n = nums.size();
         vector<int> sum(n + , );
         for (int i = ; i <= n; i++) sum[i] = sum[i - ] + nums[i - ];
         vector<vector<int>> dp(n + , vector<int>(m + , INT_MAX));
         for (int i = ; i <= n; i++) dp[i][] = sum[i];
         for (int i = ; i <= n; i++)
         {
             for (int j = ; j <= min(m, i); j++)
             {
                 for (int k = ; k < i; k++)
                 {
                     int tmp = sum[i] - sum[k];
                     dp[i][j] = min(dp[i][j], max(tmp, dp[k][j - ]));
                 }
             }
         }
         return dp[n][m];
     }
 };