Maximum path sum I Problem 18
2013-10-23 21:07
323 查看
#include<iostream>
using namespace std;
int main()
{
int data[15][15] = {
{75},
{95,64},
{17,47,82},
{18,35,87,10},
{20,4,82,47,65},
{19,1,23,75,3,34},
{88,2,77,73,7,63,67},
{99,65,4,28,6,16,70,92},
{41,41,26,56,83,40,80,70,33},
{41,48,72,33,47,32,37,16,94,29},
{53,71,44,65,25,43,91,52,97,51,14},
{70,11,33,28,77,73,17,78,39,68,17,57},
{91,71,52,38,17,14,91,43,58,50,27,29,48},
{63,66,4,68,89,53,67,30,73,16,69,87,40,31},
{4,62,98,27,23,9,70,98,73,93,38,53,60,4,23,}};
for(int i=14;i>=0;i--)
{
n--;
for (int j=0;j<n;j++)
if (data[i][j]>data[i][j+1])
data[i-1][j]+=data[i][j];
else
data[i-1][j]+=data[i][j+1];
}
cout<<data[0][0]<<endl;
}
using namespace std;
int main()
{
int data[15][15] = {
{75},
{95,64},
{17,47,82},
{18,35,87,10},
{20,4,82,47,65},
{19,1,23,75,3,34},
{88,2,77,73,7,63,67},
{99,65,4,28,6,16,70,92},
{41,41,26,56,83,40,80,70,33},
{41,48,72,33,47,32,37,16,94,29},
{53,71,44,65,25,43,91,52,97,51,14},
{70,11,33,28,77,73,17,78,39,68,17,57},
{91,71,52,38,17,14,91,43,58,50,27,29,48},
{63,66,4,68,89,53,67,30,73,16,69,87,40,31},
{4,62,98,27,23,9,70,98,73,93,38,53,60,4,23,}};
for(int i=14;i>=0;i--)
{
n--;
for (int j=0;j<n;j++)
if (data[i][j]>data[i][j+1])
data[i-1][j]+=data[i][j];
else
data[i-1][j]+=data[i][j+1];
}
cout<<data[0][0]<<endl;
}
相关文章推荐
- projecteuler---->problem=18----Maximum path sum I
- Maximum path sum I [Project Euler.Problem 18]
- Problem 18:Maximum path sum I
- Project Euler Problem 18 Maximum path sum I
- Project Euler:Problem 18 Maximum path sum I
- Problem 18 Maximum path sum I (dp)
- Project Euler:Problem 67 Maximum path sum II
- Problem Binary Tree Maximum Path Sum
- Problem 67 Maximum path sum II (dp)
- Project Euler 题解 #18 & #67 Maximum path sum
- Project Euler Problem 67 Maximum path sum II
- project euler 18 Maximum path sum I
- Binary Tree Maximum Path Sum
- LeetCode - Binary Tree Maximum Path Sum
- 【leetcode】Binary Tree Maximum Path Sum
- LeetCode Binary Tree Maximum Path Sum
- [Leetcode]Binary Tree Maximum Path Sum
- Binary Tree Maximum Path Sum
- Binary Tree Maximum Path Sum
- 树的最大路径和 Binary Tree Maximum Path Sum