HDU 6024 Building Shops【DP】

题目链接

题意：在x轴上有n个classroom，要选择若干个classroom建candy shop。对每个classroom，给出它的位置坐标和在这个点建candy shop的费用。总费用为所有建candy shop的点的建造费用之和加上所有没建candy shop的classroom到它左边离它最近的candy shop的距离之和。求最小的总费用。

很容易看出是一个dp。对于每个建candy shop的点，我很关心它左边离它最近的点是哪个。因此令dp[i][j]表示1到i中最右边的candy shop为j的最小总费用。

若当前这个点建了candy shop，对于这i个点它就是最右边的candy shop，所以dp[i][i]=min{dp[i][i],dp[i-1][1~i-1]+cost[i]}。若这个点没建candy shop，则dp[i][j]=min{dp[i][j],dp[i-1][j]+x[j]-x[i]}，其中1<=j<i。扫一遍最后在dp[n][1]~dp[n][n]中取个最小值就行。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define ll long long
const int maxn = 3010;
const int INF = 0x3f3f3f3f;

int n;
ll dp[maxn][maxn];

struct Node
{
	ll x, c;
} node[maxn];

bool cmp(Node a, Node b)
{
	return a.x < b.x;
}

int main()
{
	while (scanf("%d", &n) != EOF)
	{
		for (int i = 1; i <= n; i++)
			scanf("%lld %lld", &node[i].x, &node[i].c);
		sort(node + 1, node + n + 1, cmp);
		memset(dp, INF, sizeof(dp));
		dp[1][1] = node[1].c;
		for (int i = 2; i <= n; i++)
		{
			for (int j = 1; j < i; j++)
			{
				dp[i][i] = min(dp[i][i], dp[i - 1][j] + node[i].c);
				dp[i][j] = min(dp[i][j], dp[i - 1][j] + node[i].x - node[j].x);
			}
		}
		ll ans = INF;
		for (int i = 1; i <= n; i++)	ans = min(ans, dp[n][i]);
		printf("%lld\n", ans);
	}
	return 0;
}