Best Time to Buy and Sell Stock IV

Say you have an array for which the i^th element is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete at most k transactions.

Note:
You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

Credits:
Special thanks to @Freezen for adding this problem and creating all test cases.

Solution:

class Solution {
public:
    int maxProfit(int k, vector<int>& prices) {
        int len = prices.size();
        if(len == 0) return 0;
        int maxprofit = 0;
        if(k > len / 2)
        {
            for(int i = 1; i < len; ++i)
            {
                maxprofit += max(prices[i] - prices[i-1], 0);
            }

            return maxprofit;
        }
        vector<vector<int> > global(len, vector<int>(k + 1, 0));
        vector<vector<int> > local(len, vector<int>(k + 1, 0));
        for(int i = 1; i < len; ++i)
        {
            int diff = prices[i] - prices[i-1];
            for(int j = 1; j <= k; ++j)
            {
                local[i][j] = max(global[i-1][j-1], local[i-1][j] + diff);
                global[i][j] = max(global[i-1][j], local[i][j]);
            }
        }

        return global[len-1][k];
    }
};