Project Euler:Problem 67 Maximum path sum II
来源:互联网 发布:在淘宝怎么打开淘口令 编辑:程序博客网 时间:2024/06/02 04:19
By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.
3
7 4
2 4 6
8 5 9 3
That is, 3 + 7 + 4 + 9 = 23.
Find the maximum total from top to bottom in triangle.txt (right click and 'Save Link/Target As...'), a 15K text file containing a triangle with one-hundred rows.
NOTE: This is a much more difficult version of Problem 18. It is not possible to try every route to solve this problem, as there are 299 altogether! If you could check one trillion (1012) routes every second it would take over twenty billion years to check them all. There is an efficient algorithm to solve it. ;o)
动态规划
#include <iostream>#include <string>#include <vector>#include <fstream>using namespace std;int main(){ifstream input;string line;input.open("triangle.txt");vector<vector<int>>data;vector<int>num;while (getline(input, line)){num.clear();int tmp = 0;for (int i = 0; i < line.length(); i++){if (i % 3 == 2)continue;if (i % 3 == 1){tmp = tmp * 10 + line[i] - '0';num.push_back(tmp);tmp = 0;}elsetmp += line[i] - '0';}data.push_back(num);}input.close();for (int i = data.size() - 2; i >= 0; i--){for (int j = 0; j < data[i].size(); j++){data[i][j] = data[i + 1][j]>data[i + 1][j + 1] ? data[i][j] + data[i + 1][j] : data[i][j] + data[i + 1][j + 1];}}cout << data[0][0] << endl;system("pause");return 0;}
0 0
- Project Euler:Problem 67 Maximum path sum II
- Project Euler Problem 67 Maximum path sum II
- Maximum path sum I [Project Euler.Problem 18]
- Project Euler:Problem 18 Maximum path sum I
- Project Euler Problem 18 Maximum path sum I
- Project Euler 题解 #18 & #67 Maximum path sum
- project euler 18 Maximum path sum I
- Problem 67 Maximum path sum II (dp)
- Project Euler:Problem 81 Path sum: two ways
- Project Euler:Problem 82 Path sum: three ways
- Project Euler:Problem 83 Path sum: four ways
- Project Euler - Problem 67
- Project Euler problem 67
- Project Euler:Problem 69 Totient maximum
- 【Project Euler】【Problem 6】Sum square difference
- project euler problem 13:Large sum
- Project Euler:Problem 13 Large sum
- Project Euler:Problem 16 Power digit sum
- java基础第五天
- HttpServletResponse对象(一)
- 将string转换成char型的一般方法
- Excel Sheet Column Number (leetcode 171)
- [MEMO] Python argument passing
- Project Euler:Problem 67 Maximum path sum II
- android Spinner控件详解
- 简单的ftp服务器实现 (java)
- B树
- Android 仿联系人列表 实现ListView的A-Z字母排序和过滤搜索功能,并挤压效果
- HttpServletResponse对象(二)
- C#高级编程四十天----运算符重载
- Yii2学习笔记(九):行为Behavior的使用
- 2015071502 - 东北