The Triangle
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 21935 | Accepted: 12676 |
Description
7Figure 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.
3 8
8 1 0
2 7 4 4
4 5 2 6 5
(Figure 1)
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
Source
第一个自己写的DP的题目,内流满面啊!加油加油!
#include<iostream>
using namespace std;
#define max(x,y) ((x)>(y)?(x):(y))
int main()
{
//ifstream cin("test.txt");
int n,i,j;
int arr[101][101] = {0};
int out;
while(cin>>n)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=i;j++)
{
cin>>arr[i][j];
arr[i][j] += max(arr[i-1][j],arr[i-1][j-1]);
}
}
out = 0;
for(i=1;i<=n;i++)
out = out<arr[n][i]?arr[n][i]:out;
cout<<out<<endl;
}
return 0;
}
using namespace std;
#define max(x,y) ((x)>(y)?(x):(y))
int main()
{
//ifstream cin("test.txt");
int n,i,j;
int arr[101][101] = {0};
int out;
while(cin>>n)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=i;j++)
{
cin>>arr[i][j];
arr[i][j] += max(arr[i-1][j],arr[i-1][j-1]);
}
}
out = 0;
for(i=1;i<=n;i++)
out = out<arr[n][i]?arr[n][i]:out;
cout<<out<<endl;
}
return 0;
}