POJ 1163: The Triangle(dp)
来源:互联网 发布:java类的成员变量 编辑:程序博客网 时间:2024/06/11 17:34
【原题】
Write a program that calculates the highest sum of numbers passed on a route that starts at the top and ends somewhere on the base. Each step can go either diagonally down to the left or diagonally down to the right.
【Input】
Your program is to read from standard input. The first line contains one integer N: the number of rows in the triangle. The following N lines describe the data of the triangle. The number of rows in the triangle is > 1 but <= 100. The numbers in the triangle, all integers, are between 0 and 99.
【Output】
Your program is to write to standard output. The highest sum is written as an integer.
【Sample Input】
5
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
【Sample Output】
30
【题意】
给出一个数字三角形,从三角形顶部数字走,每次只能走到这个数字的左下角或者右下角的数字,直到底部,计算走过的线路的数字之和,求这个和的最大值
这是经典dp 问题,因为我最近才接触动态规划,惊奇地发现题都特别有意思,只要能找到递推方程,问题就很容易解决了。
从底层向上递推,方程为:
dp[i][j]=max(num[i][j]+dp[i+1][j],num[i][j]+dp[i+1][j+1])
#include<cstdio>#include<iostream>using namespace std;const int maxn = 100 + 5;int dp[maxn][maxn];int num[maxn][maxn];int main() { int n; int i, j; scanf("%d", &n); for (i = 1; i <= n; i++) for (j = 1; j <= i; j++) scanf("%d", &num[i][j]); for (i = 1; i <= n; i++) //初始化 dp[n][i] = num[n][i]; for (i = n - 1; i > 0; i--) //从底层向上递推 for (j = 1; j <= i; j++) dp[i][j] = max(num[i][j] + dp[i + 1][j], num[i][j] + dp[i + 1][j + 1]); printf("%d\n", dp[1][1]); return 0;}
- POJ 1163 The Triangle (简单DP)
- poj - 1163 - The Triangle(dp)
- POJ 1163 The Triangle (DP)
- POJ 1163 The Triangle(DP)
- POJ 1163 The Triangle(dp)
- POJ 1163 The Triangle(基础DP)
- POJ 1163&& 3176 The Triangle(DP)
- poj 1163 the triangle(dp)
- POJ 1163 The Triangle (DP)
- POJ 1163: The Triangle(dp)
- POJ 1163 The Triangle (DP)
- POJ 1163 The Triangle【DP】
- poj 1163 The Triangle【dp】
- [DP] POJ 1163 The Triangle
- POJ 1163 The Triangle DP
- poj 1163 The Triangle --dp
- POJ 1163 The Triangle [DP]
- poj 1163 The Triangle(第一道DP~~~~)
- IO问题定位全过程
- RecyclerView滚动事件
- poj 1845 Sumdiv 素数筛+快速幂求逆元+二分乘法
- Mac编程python小白配置pycharm破解版
- 数组复制
- POJ 1163: The Triangle(dp)
- Okio库 Timeout类源码解析
- 关于Movie Studio插入素材格式问题
- JS学习笔记3_函数表达式
- config
- sklearn文档 — 1.8. 交叉分解
- java之代理proxy
- 优惠券2
- Python3 HashSet