POJ 1163 The Triangle
2017-07-15 19:56
274 查看
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
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 49941 | Accepted: 30163 |
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 简单DP
#include <iostream> #include <cstdio> #include <cstring> #include <queue> #include <cmath> #include <vector> #include <algorithm> using namespace std; #define lowbit(x) (x&(-x)) #define max(x,y) (x>y?x:y) #define min(x,y) (x<y?x:y) #define mem(a) (memset(a,0,sizeof(a))) typedef long long ll; int main() { int n,a[105][105]; int d[105][105]; scanf("%d",&n); for(int i=1;i<=n;i++) { for(int j=1;j<=i;j++) { scanf("%d",&a[i][j]); } } for(int i=1;i<=n;i++) d [i]=a [i]; for(int i=n-1;i>=1;i--) { for(int j=1;j<=i;j++) { d[i][j]=a[i][j]+max(d[i+1][j+1],d[i+1][j]); } } cout<<d[1][1]; return 0; }
相关文章推荐
- poj_1163 the triangle
- POJ 1163: The Triangle(dp)
- POJ 1163 The Triangle
- poj 1163 the triangle(dp)
- POJ1163 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
- POJ-1163-The Triangle-递推动规
- POJ 1163 The Triangle
- poj 1163 The Triangle
- poj-1163-The Triangle-动态规划dp
- The Triangle(POJ-1163)
- poj 1163 The Triangle
- poj 1163 The Triangle【dp】
- poj 1163 The Triangle
- POJ 1163 The Triangle (动态规划)