Partition Array for Maximum Sum

Given an array of positive integers and an integer k, you need to partition the array into k non-empty adjacent subarrays such that the partitioned subarrays have a maximum sum. Return the maximum sum you can get.