POJ1163 The Triangle
2017-04-10 21:59
351 查看
动态规划题,从下往上较大的相加:
#include<stdio.h> int max(int i,int j) { if(i>j) return i; else return j; } int main() { int n; int a[100][100]; int msum[100][100];//保存在msum中 while(scanf("%d\n",&n)!=EOF) { for(int i=0;i<n;i++) { for(int j=0;j<=i;j++) { scanf("%d\n",&a[i][j]); } } for(int i=0;i<n;i++) { msum[n-1][i]=a[n-1][i]; } for(int i=n-2;i>=0;i--) { for(int j=0;j<=i;j++) { msum[i][j] = max(msum[i+1][j],msum[i+1][j+1])+a[i][j]; } } printf("%d\n",msum[0][0]); } return 0; }
相关文章推荐
- POJ 1163 The Triangle
- POJ 1163 The Triangle (简单线性dp)
- poj 1163 The Triangle
- POJ1163 The Triangle
- poj1163 The Triangle ——DP入门题
- Poj 1163 The Triangle
- POJ_1163_The Triangle
- 0808 poj#1163 The Triangle
- POJ-1163-The Triangle
- POJ-1163-The Triangle-动态规划
- poj 1163-小白算法练习 The Triangle 动态规划
- POJ 1163 The Triangle (动态规划)
- poj 1163 The Triangle
- POJ 1163 The Triangle(DP)
- POJ-1163-The Triangle-递推动规
- POJ-1163-The Triangle
- poj 1163 The Triangle 动态规划
- The Triangle - POJ 1163 水题
- poj 1163__The Triangle(dp)
- poj 1163 The Triangle