HDD 6024 Building Shops (二维DP)

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=6024

输入不是按坐标从小到大输入的，先需要按坐标从小到大排序

dp[i][j]表示前i个教室，最右边糖果店在第j个教室时的花费

状态转移方程：

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <map>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
static const int MAX_N = 3e3 + 5;
static const ll Mod = 1e9 + 7;
static const ll INF = (ll)1 << 60;
struct Node{
	int x, c;
	bool operator < (const Node &rhs) const {
		return x < rhs.x;
	}
}a[MAX_N];
ll dp[MAX_N][MAX_N];
int main() {	
	/*freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);*/
	int n;
	while (scanf("%d", &n) != EOF) {
		for (int i = 0; i < n; ++i) scanf("%d%d", &a[i].x, &a[i].c);
		sort(a, a + n);
		dp[0][0] = a[0].c;
		for (int i = 1; i < n; ++i) {
			for (int j = 0; j < i; ++j) dp[i][j] = dp[i - 1][j] + a[i].x - a[j].x;
			dp[i][i] = INF;
			for (int j = 0; j < i; ++j) dp[i][i] = min(dp[i][i], dp[i - 1][j] + a[i].c);
		}
		ll min_v = INF;
		for (int i = 0; i < n; ++i) min_v = min(min_v, dp[n - 1][i]);
		printf("%lld\n", min_v);
	}
	return 0;
}

dp数组列数可以压成2

dp[i][0]表示第i个教室有糖果店

dp[i][1]表示第i个教室无糖果店

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <map>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
static const int MAX_N = 3e3 + 5;
static const ll Mod = 1e9 + 7;
static const ll INF = (ll)1 << 60;
struct Node {
	int x, c;
	bool operator < (const Node &rhs) const {
		return x < rhs.x;
	}
}a[MAX_N];
ll dp[MAX_N][2];
int main() {
//	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);
	int n;
	while (scanf("%d", &n) != EOF) {
		for (int i = 0; i < n; ++i) scanf("%d%d", &a[i].x, &a[i].c);
		sort(a, a + n);
		dp[0][0] = a[0].c;
		dp[0][1] = INF;
		for (int i = 1; i < n; ++i) {
			dp[i][0] = min(dp[i - 1][0], dp[i - 1][1]) + a[i].c;
			dp[i][1] = INF;
			ll dx = 0;
			for (int j = i - 1; j >= 0; --j) {
				dx += (i - j) * ((ll)a[j + 1].x - a[j].x);//[j+1,i]所有教室的距离花费
				dp[i][1] = min(dp[i][1], dp[j][0] + dx);
			}
		}
		printf("%lld\n", min(dp[n - 1][0], dp[n - 1][1]));
	}
	return 0;
}