POJ-1163(DP,Water)
2011-08-16 06:58
363 查看
1163:The Triangle
查看
提交
统计
提问
时间限制:
1000ms
内存限制:
65536kB
描述
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.
输入
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 rowsin the triangle is > 1 but <= 100. The numbers in the triangle, all integers, are between 0 and 99.
输出
Your program is to write to standard output. The highest sum is written as an integer.
样例输入
5
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
样例输出
30
查看
提交
统计
提问
#include"iostream"
using namespace std;
int max(int x,int y)
{
if(x>y)
return x;
else
return y;
}
int main()
{
int row;
cin>>row;
int** matrix=new int*[row+1];
for(int i=0;i<row+1;i++)
matrix[i]=new int[row+1];
for(int i=1;i<=row;i++)
for(int j=1;j<=i;j++)
cin>>matrix[i][j];
for(int i=row-1;i>=1;i--)
for(int j=1;j<=i;j++)
{
matrix[i][j]+=max(matrix[i+1][j],matrix[i+1][j+1]);
}
cout<<matrix[1][1]<<endl;
}
查看
提交
统计
提问
时间限制:
1000ms
内存限制:
65536kB
描述
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.
输入
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 rowsin the triangle is > 1 but <= 100. The numbers in the triangle, all integers, are between 0 and 99.
输出
Your program is to write to standard output. The highest sum is written as an integer.
样例输入
5
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
样例输出
30
查看
提交
统计
提问
#include"iostream"
using namespace std;
int max(int x,int y)
{
if(x>y)
return x;
else
return y;
}
int main()
{
int row;
cin>>row;
int** matrix=new int*[row+1];
for(int i=0;i<row+1;i++)
matrix[i]=new int[row+1];
for(int i=1;i<=row;i++)
for(int j=1;j<=i;j++)
cin>>matrix[i][j];
for(int i=row-1;i>=1;i--)
for(int j=1;j<=i;j++)
{
matrix[i][j]+=max(matrix[i+1][j],matrix[i+1][j+1]);
}
cout<<matrix[1][1]<<endl;
}
相关文章推荐
- poj 1163 the triangle(dp)
- POJ 1163 The Triangle(数塔模型dp)
- poj 1163 DP
- poj 1163/3176 数字三角形【简单DP】
- POJ 1163 The Triangle【dp+杨辉三角加强版(递归)】
- poj 1163 The Triangle &poj 3176 Cow Bowling (dp)
- poj 1163 The Triangle --dp
- poj 1163经典DP
- POJ 1163 The Triangle【DP】
- POJ 1163 最佳路径简单DP
- POJ 1163 The Triangle & POJ 3176 Cow Bowling(DP动态规划)
- POJ 1163 The Triangle【DP】递归和递推
- POJ 1163: The Triangle(dp)
- POJ 1163 The Triangle 简单DP
- ACM POJ 1163 The Triangle DP
- POj 1163 DP
- POJ 1163 The Triangle (简单线性dp)
- POJ 1163 The Triangle 简单DP
- poj 1205 :Water Treatment Plants (DP+高精度)
- poj1163 递归或dp