欧拉计划 题目18
从下面的三角形的顶端开始,向下面一行的相邻数字移动,从顶端到底端的最大总和为23.
3
74
2 46
8 5 93
也就是 3 + 7 + 4 + 9 = 23.
找出从以下三角形的顶端走到底端的最大总和:
75
95 64
17 47 82
18 35 87 10
20 04 82 47 65
19 01 23 75 03 34
88 02 77 73 07 63 67
99 65 04 28 06 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 04 68 89 53 67 30 73 16 69 87 40 31
04 62 98 27 23 09 70 98 73 93 38 53 60 04 23
每次遇到这种题目总是想用深搜的方法来做题。
今天无意中看到一个大牛的代码,心中万分膜拜。其中也用到了以前从没有接触的sscanf()函数。
通过理解,写下此代码,希望自己能够记住这种解题思路。
View Code
1 #include<iostream> 2 #include<string> 3 using namespace std; 4 5 int main() 6 { 7 char *map[20] = { 8 "75 00 00 00 00 00 00 00 00 00 00 00 00 00 00", 9 "95 64 00 00 00 00 00 00 00 00 00 00 00 00 00", 10 "17 47 82 00 00 00 00 00 00 00 00 00 00 00 00", 11 "18 35 87 10 00 00 00 00 00 00 00 00 00 00 00", 12 "20 04 82 47 65 00 00 00 00 00 00 00 00 00 00", 13 "19 01 23 75 03 34 00 00 00 00 00 00 00 00 00", 14 "88 02 77 73 07 63 67 00 00 00 00 00 00 00 00", 15 "99 65 04 28 06 16 70 92 00 00 00 00 00 00 00", 16 "41 41 26 56 83 40 80 70 33 00 00 00 00 00 00", 17 "41 48 72 33 47 32 37 16 94 29 00 00 00 00 00", 18 "53 71 44 65 25 43 91 52 97 51 14 00 00 00 00", 19 "70 11 33 26 77 73 17 78 39 68 17 57 00 00 00", 20 "91 71 52 38 17 14 91 43 58 50 27 29 48 00 00", 21 "63 66 04 68 89 53 67 30 73 16 69 87 40 31 00", 22 "04 62 98 27 23 09 70 98 73 93 38 53 60 04 23"}; 23 int num[20][20] , i , j; 24 for(i = 0; i < 15; i++) 25 sscanf(map[i],"%d %d %d %d %d %d %d %d %d %d %d %d %d %d %d",num[i],num[i]+1,num[i]+2,num[i]+3,num[i]+4, 26 num[i]+5,num[i]+6,num[i]+7,num[i]+8,num[i]+9,num[i]+10,num[i]+11,num[i]+12,num[i]+13,num[i]+14); 27 for(i = 13; i >=0; i--) 28 for(j = 0; j < i+1; j++) 29 { 30 if(num[i+1][j] >= num[i+1][j+1]) 31 num[i][j] += num[i+1][j]; 32 else num[i][j] += num[i+1][j+1]; 33 } 34 cout<<num[0][0]<<endl; 35 return 0; 36 }
既然选择了这条路,就应该坚持下去。