第318场力扣周赛 最小移动总距离 --- 记忆化搜索/dp + 数学推导

记忆化搜索写法

class Solution {
public:
	
    long long minimumTotalDistance(vector<int>& a, vector<vector<int>>& fac) {
        sort(a.begin(), a.end());
        sort(fac.begin(), fac.end());
        int n = a.size(), m = fac.size();
    	
        vector<vector<long long>> f(n + 1, vector<long long>(m + 1, 0));
        vector<vector<long long>> d(n + 1, vector<long long>(m + 1, 0));
        
        for(int j = 0; j < m; j ++)
            for(int i = n - 1; i >= 0; i --)
                d[i][j] = d[i + 1][j] + abs(a[i] - fac[j][0]);
        
		function<long long(int,int)> dfs = [&](int i, int j) -> long long
		{
            if(f[i][j]) return f[i][j];
            if(i == n) return 0ll;
			if(j == m - 1)
			{
				if(n - i > fac[j][1]) return 1e18;
				return d[i][j];
			}
			f[i][j] = dfs(i, j + 1);
			long long s = 0, k = 1;
			while(k <= fac[j][1] && i + k - 1 < n)
			{
				s += abs(a[i + k - 1] - fac[j][0]);
				f[i][j] = min(f[i][j], s + dfs(i + k, j + 1));
				k ++;
			}
			return f[i][j];
		};
		return dfs(0, 0);
    }
};

dp写法

class Solution {
public:
    long long minimumTotalDistance(vector<int>&a, vector<vector<int>> &fac) {
        sort(fac.begin(), fac.end());
        sort(a.begin(), a.end());
        int n = a.size();
        vector<long long> f(n + 1, 1e18);
        f[0] = 0;
        for(auto &fa: fac)
            for(int j = n; j > 0; j--) 
            {
                long long cost = 0ll;
                for(int k = 1; k <= min(j, fa[1]); k ++) 
                {
                    cost += abs(a[j - k] - fa[0]);
                    f[j] = min(f[j], f[j - k] + cost);
                }
            }
        return f[n];
    }
};