project euler problem 18 动态规划
2013-10-06 21:13
281 查看
这题就像POJ中的1163题。一样解法,简单的动态规划。
#include <iostream> #include <map> #include <string> #include <cstring> #include <cstdio> #include <cmath> #include <algorithm> using namespace std; int a[101][101]; int main() { int i,j; for(i=0; i<15; i++) for(j=0; j<=i; j++) cin >> a[i][j]; for(i=13; i>=0; i--) for(j=0; j<i+1; j++) a[i][j]+=max(a[i+1][j],a[i+1][j+1]); //动态规划 cout<<a[0][0]<<endl; return 0; }
相关文章推荐
- Maximum path sum I [Project Euler.Problem 18]
- Project Euler problem 18
- Project Euler Problem 18 Maximum path sum I
- http://projecteuler.net/problem=18 [Answer:1074]
- project euler Problem 18 & 36
- project euler Problem 18 & 36
- project euler Problem 34
- Project Euler problem 68
- Project Euler Problem 05 C# solution
- Project Euler Problem 28
- project euler Problem 15
- Project Euler problem 54
- Project Euler Problem 51-70
- Project Euler problem 62
- Project Euler problem 64
- project euler problem 15
- Project Euler Problem 48: Self powers
- project euler problem 35求一个数的所有循环数都是素数的总共有多少个
- http://projecteuler.net/problem=8 [Answer:40824]
- Project Euler Problem 1