hdu4283(You Are the One)(dps+dp)
2012-10-28 17:25
351 查看
http://acm.hdu.edu.cn/showproblem.php?pid=4283
(1)代码量短,主要是要分析清楚问题的本质。用到深搜和动态规划,精髓是动态规划里包含的思维。
他人代码:
View Code
(1)代码量短,主要是要分析清楚问题的本质。用到深搜和动态规划,精髓是动态规划里包含的思维。
他人代码:
View Code
#include <iostream> #include <cstdio> #include <algorithm> #define INF 0x3f3f3f3f #define MAXN 100 using namespace std; int N, s[MAXN+5], f[MAXN+5][MAXN+5], seq[MAXN+5]; int dfs(int x, int y) { if (f[x][y] != INF) { return f[x][y]; } else if (x >= y) return 0; for (int i = 0; i <= y-x ; ++i) { f[x][y] = min(f[x][y], dfs(x+1, x+i) + dfs(x+i+1, y) + (i+1)*(s[y]-s[x+i]) + i*seq[x]); } return f[x][y]; } int main() { int T, ca = 0; scanf("%d", &T); while (T--) { memset(f, 0x3f, sizeof (f)); scanf("%d", &N); for (int i = 1; i <= N; ++i) { scanf("%d", seq+i); s[i] = s[i-1] + seq[i]; } printf("Case #%d: %d\n", ++ca, dfs(1, N)); } return 0; }
相关文章推荐
- hdu4283 You Are the One 区间dp 记忆化搜索or递推
- hdu4283 you are the one 区间DP
- hdu4283 You Are the One(区间DP)
- HDU4283 You Are the One(区间dp)
- HDU4283:You Are the One(区间DP)
- hdu4283 You Are the One 区间DP
- HDU4283 You Are the One (DP)
- hdu4283---You Are the One(区间dp)
- HDU4283:You Are the One(区间DP)
- HDU4283:You Are the One(区间DP)
- hdu4283 You Are the One 区间DP
- HDU4283:You Are the One(区间DP)
- HDU4283 You Are the One(区间dp)
- hdu4283 You Are the One(区间dp,思考)
- hdu4283 You Are the One(区间DP)
- hdu4283 You Are the One(区间DP)
- HDU4283——You Are the One(区间dp)
- You Are the One (区间dp)
- You Are the One(区间DP)
- You Are the One(利用栈的性质的区间DP)