Project Euler:Problem 67 Maximum path sum II
2015-07-15 23:01
295 查看
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)
动态规划
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; } else tmp += 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; }
相关文章推荐
- Yii2学习笔记(九):行为Behavior的使用
- C#高级编程四十天----运算符重载
- HttpServletResponse对象(二)
- 2015071501 - 望京地铁A口
- php mysqli的乱码设置
- 每天定时重启/关机命令
- Excel Sheet Column Number (leetcode 171)
- vim编辑器常用命令
- 使用blktrace排查iowait cpu高的问题
- 除非 Windows Activation Service (WAS)和万维网发布服务(W3SVC)均处于运行状态,
- 从创始人到扫地出门,1号店董事长和CEO离职信曝光
- MFC 数据类型
- 瀑布流接口的设计以及应用(五)
- HttpServletResponse对象(一)
- 13.Java5条件阻塞Condition的应用
- SQLite数据库
- [leetcode] Search for a Range
- centos 重启网站服务器 httpd
- L3:==、java.lang.Object 类、toString()
- C语言函数之可变参数原理:va_start、va_arg及va_end