#include <stdio.h> //动态规划 #define MAX 101 int maxSum[MAX][MAX]; int m; int D[MAX][MAX]; int Maxsum(int i,int j) { if (maxSum[i][j]!=-1) return maxSum[i][j]; if (i==m) maxSum[i][j]=D[i][j]; else { int x = Maxsum(i+1,j); int y = Maxsum(i+1,j+1); maxSum[i][j]=((x>y)?x:y)+D[i][j]; } return maxSum[i][j]; } int main() { int i,j,n,m,o; scanf("%d",&n); for (o=1;o<=n;o++) { scanf("%d",&m); for (i=1;i<=m;i++) { for (j=1;j<=i;j++) { scanf("%d",&D[i][j]); maxSum[i][j]=-1; } } printf("%d\n",Maxsum(1,1)); } return 0; }
解题思路:
注意事项:
参考代码:
0.0分
0 人评分
C语言程序设计教程(第三版)课后习题10.5 (C语言代码)浏览:543 |
【绝对值排序】 (C++代码)浏览:670 |
C语言程序设计教程(第三版)课后习题3.7 (C语言代码)浏览:840 |
简单的a+b (C语言代码)浏览:523 |
幸运数 (C++代码)浏览:1258 |
矩形面积交 (C++代码)浏览:1125 |
DNA (C语言代码)浏览:735 |
陶陶摘苹果2 (C语言代码)浏览:595 |
1134题解(求分析)浏览:722 |
最好的,浏览:561 |