POJ1163 The Triangle 【DP】
2014-07-19 08:41
211 查看
The Triangle
Description
Figure 1 shows a number triangle. 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
Sample Output
int dp[102][102];
int max(int a, int b){ return a > b ? a : b; }
int main()
{
int n, i, j, ans;
scanf("%d", &n);
for(i = 1; i <= n; ++i){
for(j = 1; j <= i; ++j){
scanf("%d", &dp[i][j]);
dp[i][j] += max(dp[i-1][j], dp[i-1][j-1]);
}
}
ans = 0;
for(i = 1; i <= n; ++i)
if(dp
[i] > ans) ans = dp
[i];
printf("%d\n", ans);
return 0;
}
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 36918 | Accepted: 22117 |
7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 (Figure 1)
Figure 1 shows a number triangle. 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
题意:入门级数塔。
题解:用数组存储起点到任一点的最大值为后面的计算提供便利。
#include <stdio.h>int dp[102][102];
int max(int a, int b){ return a > b ? a : b; }
int main()
{
int n, i, j, ans;
scanf("%d", &n);
for(i = 1; i <= n; ++i){
for(j = 1; j <= i; ++j){
scanf("%d", &dp[i][j]);
dp[i][j] += max(dp[i-1][j], dp[i-1][j-1]);
}
}
ans = 0;
for(i = 1; i <= n; ++i)
if(dp
[i] > ans) ans = dp
[i];
printf("%d\n", ans);
return 0;
}
相关文章推荐
- POJ 1163 The Triangle + HDU 2084 数塔(递推dp)
- NYOJ 18. The triangle(基础DP)
- poj1163 dp the triangle
- poj 1163 The Triangle 因为这个,发现DP很有意思
- POJ 1163 The Triangle DP 逐点累加
- ACM POJ 1163 The Triangle DP
- POJ1163 The Triangle dp C语言
- pku 1163 dp TheTriangle 解题报告
- nyoj 18 The Triangle 【经典dp】
- poj-3176 Cow Bowling &&poj-1163 The Triangle && hihocoder #1037 : 数字三角形 (基础dp)
- poj 1163 The Triangle --dp
- POJ1163 The Triangle 【DP】
- hdu1029 Ignatius and the Princess IV(DP求数列中出现次数过半的数)
- hdu 4283 You Are the One 区间DP 解题报告
- cf-279D - The Minimum Number of Variables-数位dp
- 【HDU 4901 多校联合】The Romantic Hero【DP】
- 【dp】Arrange the Schedule
- DP(01背包) UESTC 1218 Pick The Sticks (15CCPC C)
- uva10308 - Roads in the North 树形DP
- The Cow Lexicon(dp)