动态规划全情况思路

1.拼硬币问题

 

 

 

 

 

 

day2：

int GetMin(vector<vector<int>> &cost) {
	int n = cost.size();
	vector<vector<int>> f(n+1, vector<int>(3,0));

	f[0][0] = 0;
	f[0][1] = 0;
	f[0][2] = 0;

	for (int i = 1; i <= n; i++) {
		f[i][0] = min(f[i - 1][1], f[i - 1][2]) + cost[i - 1][0];
		f[i][1] = min(f[i - 1][0], f[i - 1][2]) + cost[i - 1][1];
		f[i][2] = min(f[i - 1][0], f[i - 1][1]) + cost[i - 1][2];
	}

	return min(min(f[n][0], f[n][1]), f[n][2]);
}

 

 

int GetMM(vector<vector<int>>& A) {
	int m = A.size(), n = A[0].size();
	vector<vector<int>> f(m, vector<int>(n, 0));

	f[0][0] = 1;
	for (int i = 0; i < m; i++) 
		for (int j = 0; j < n; j++) {
			if (i == 0 && j == 0) continue;
			f[i][j] += min(i > 0 ? f[i - 1][j] : INTPTR_MAX, j > 0 ? f[i][j - 1] : INTPTR_MAX) + A[i][j];
		}
	return f[m-1][n-1];
}

 

 

 

 

 

 

 

 

 

int BestTimeToBuyAndSell(vector<int> P) {
	int n = P.size();
	if (n == 0) return 0;
	vector<vector<int>> f(n + 1, vector<int>(5 + 1, 0));

	f[0][1] = 0;
	for (int i = 2; i <= 5; i++)
		f[0][i] = INT_MIN;

	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= 5; j += 2) {
			f[i][j] = f[i - 1][j];
			if (j > 1 && i > 1 && f[i - 1][j - 1] != INT_MIN)
				f[i][j] = max(f[i][j], f[i - 1][j - 1] + P[i - 1] - P[i - 2]);
		}

		for (int j = 2; j <= 5; j += 2) {
			f[i][j] = f[i - 1][j - 1];
			if (i > 1 && f[i - 1][j] != INT_MIN)
				f[i][j] = max(f[i][j], f[i - 1][j] + P[i - 1] - P[i - 2]);
			if (j > 2 && i > 1 && f[i - 1][j - 2] != INT_MIN)
				f[i][j] = max(f[i][j], f[i - 1][j - 2] + P[i - 1] - P[i - 2]);
		}
	}
	return max(max(f[n][1], f[n][3]), f[n][5]);
}

 

 

 

 

int GetMaxEnvelopes(vector<vector<int>> envelopes) {
	int size = envelopes.size();
	if (size == 0) return 0;

	sort(envelopes.begin(), envelopes.end(), [&](vector<int>& a, vector<int>& b) {
		if (a[0] == b[0]) {
			if (a[1] < b[1])
				return true;
			else
				return false;
		} else
			return a[0] < b[0];
	});
	
	int pre_l = envelopes[0][0], pre_w = envelopes[0][1];
	vector<int> f(size + 1, 0);
	f[0] = 1;
	for (int i = 1; i < size; i++) {
		f[i] = f[i-1];
		if (envelopes[i][0] > pre_l && envelopes[i][1] > pre_w) {
			pre_l = envelopes[i][0];
			pre_w = envelopes[i][1];
			f[i] += 1;
		}
	}
	return f[size-1];
}