poj1160
2011-06-25 16:42
357 查看
动态规划
View Code
View Code
#include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> using namespace std; #define maxv 305 #define maxp 35 int cost[maxp][maxv]; int d[maxv][maxv]; int village[maxv]; int v, p; int main() { //freopen("t.txt", "r", stdin); scanf("%d%d", &v, &p); for (int i = 1; i <= v; i++) scanf("%d", &village[i]); memset(d, 0, sizeof(d)); for (int i = 1; i < v; i++) for (int j = i + 1; j <= v; j++) d[i][j] = d[i][j - 1] + village[j] - village[(i + j) / 2]; memset(cost, 0, sizeof(cost)); for (int i = 1; i <= v; i++) cost[1][i] = d[1][i]; for (int i = 2; i <= p; i++) for (int j = i; j <= v; j++) { cost[i][j] = 1000000000; for (int r = j - 1; r >= i - 1; r--) cost[i][j] = min(cost[i][j], cost[i - 1][r] + d[r + 1][j]); } printf("%d\n", cost[p][v]); return 0; }
相关文章推荐
- POJ 1160 四边形不等式优化DP Post Office
- POJ 1160 Post Office
- poj1160 Post Office
- poj 1160 动态规划(一维城市建邮局)
- 【POJ】1160 Post Office
- poj 1160 Post Office
- POJ-1160 Post Office(dp+四边形不等式)
- POJ 1160 DP
- poj1160
- POJ1160 Post Office (四边形不等式优化DP)
- POJ 1160 Post Office (经典dp)
- POJ 1160 DP
- poj 1160 Post Office
- poj 1160
- POJ1160 邮局问题
- POJ 1160 区间DP + 平行四边形优化
- [DP 四边形不等式优化] POJ 1160 Post Office
- POJ 1160 dp
- POJ-1160 Post office 四边形优化DP
- POJ 1160 Post Office