poj 3176 Cow Bowling
2011-04-04 21:07
417 查看
数塔问题,最最简单的DP了吧
#include<iostream> #define N 355 int a ,dp ; int mymax(int c,int d) { return c>d?c:d; } int main() { int n,i,j; scanf("%d",&n); for(i=1;i<=n;i++) for(j=1;j<=i;j++) scanf("%d",&a[i][j]); for(i=1;i<=n;i++) dp [i]=a [i]; for(i=n-1;i>=1;i--) for(j=1;j<=i;j++) dp[i][j]=mymax(dp[i+1][j],dp[i+1][j+1])+a[i][j]; printf("%d/n",dp[1][1]); return 0; }
相关文章推荐
- POJ 3176 Cow Bowling 保龄球 数塔问题 DP
- POJ 3176 Cow Bowling
- 挑战2.3 Cow Bowling(POJ 3176)
- POJ 1163 The Triangle & POJ 3176 Cow Bowling(DP动态规划)
- poj 3176 cow bowling
- POJ 3176-Cow Bowling [dp] 《挑战程序设计竞赛》2.3
- POJ-3176 Cow Bowling
- POJ 3176-Cow Bowling(DP||记忆化搜索)
- POJ 3176 Cow Bowling
- POJ 3176-Cow Bowling
- poj 3176 -- Cow Bowling
- POJ 3176 Cow Bowling 【动态规划】【水题】
- POJ 3176 Cow Bowling (简单DP)
- POJ3176——Cow Bowling(动态规划)
- poj 3176 -- Cow Bowling (dp)
- poj 3176 cow bowling
- poj-3176-Cow Bowling
- POJ 3176 Cow Bowling
- POJ 3176 Cow Bowling
- POJ 3176 Cow Bowling (简单DP)