POJ 1163 The Triangle(数塔模型dp)
2017-04-14 19:57
288 查看
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
30
其实就是数塔。
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
const int MAXN=102;
int a[MAXN][MAXN];
int dp[MAXN][MAXN];
int main()
{
int n;
while(~scanf("%d",&n))
{
memset(a,0,sizeof(a));
memset(dp,0,sizeof(dp));
for(int i=1;i<=n;i++)
{
for(int j=1;j<=i;j++)
{
cin>>a[i][j];
}
}
for(int i=1;i<=n;i++)
{
dp
[i]=a
[i];
}
for(int i=n-1;i>=1;i--)
{
for(int j=1;j<=i;j++)
{
dp[i][j]=max(dp[i+1][j],dp[i+1][j+1]);
dp[i][j]+=a[i][j];
}
}
printf("%d\n",dp[1][1]);
}
return 0;
}
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<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
const int MAXN=102;
int a[MAXN][MAXN];
int dp[MAXN][MAXN];
int main()
{
int n;
while(~scanf("%d",&n))
{
memset(a,0,sizeof(a));
memset(dp,0,sizeof(dp));
for(int i=1;i<=n;i++)
{
for(int j=1;j<=i;j++)
{
cin>>a[i][j];
}
}
for(int i=1;i<=n;i++)
{
dp
[i]=a
[i];
}
for(int i=n-1;i>=1;i--)
{
for(int j=1;j<=i;j++)
{
dp[i][j]=max(dp[i+1][j],dp[i+1][j+1]);
dp[i][j]+=a[i][j];
}
}
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)
- [DP] POJ - 1163 The Triangle
- POJ 1163 The Triangle 简单DP
- POJ 1163 The Triangle(基础DP)
- POJ 1163 The Triangle【DP】递归和递推
- POJ 3176-Cow Bowling/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 数塔问题)
- poj1163 The Triangle ——DP入门题
- [DP] POJ 1163 The Triangle
- POJ 1163 The Triangle(DP)
- poj - 1163 - The Triangle(dp)
- POJ 1163 The Triangle【DP】
- poj1163——The Triangle(简单dp)