Cow Bowling算法设计实验报告.docVIP

实验项目名称：Cow Bowling 所属课程名称：算法分析与设计 综合性、设计性实验成绩单 开设时间：2009学年第二学期 实 验 题 目 与 要 求 题目：Cow Bowling 要求：现在需要找到一条从树顶结点遍历到树底结点的最长路径，即遍历的结点中数字相加的和最大。且每个结点只许向其下层相邻的左右两个结点遍历。?? No.3176 解法或类型：动态规划 作者： Cow Bowling Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7899 Accepted: 5168 Description The cows dont use actual bowling balls when they go bowling. They each take a number (in the range 0..99), though, and line up in a standard bowling-pin-like triangle like this: 7   3 8   8 1 0   2 7 4 4   4 5 2 6 5 Then the other cows traverse the triangle starting from its tip and moving down to one of the two diagonally adjacent cows until the bottom row is reached. The cows score is the sum of the numbers of the cows visited along the way. The cow with the highest score wins that frame. Given a triangle with N (1 = N = 350) rows, determine the highest possible sum achievable. Input Line 1: A single integer, N Lines 2..N+1: Line i+1 contains i space-separated integers that represent row i of the triangle. Output Line 1: The largest sum achievable using the traversal rules Sample Input 5 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 Sample Output 30 Hint Explanation of the sample: 7  *  3 8  *  8 1 0  *  2 7 4 4  *  4 5 2 6 5 The highest score is achievable by traversing the cows as shown above. 题目要求 题目要我们找到一条从树顶结点遍历到树底结点的最长路径，即遍历的结点中数字相加的和最大。且每个结点只许向其下层相邻的左右两个结点遍历。#includeiostreamusing namespace std;int Arr[351][351];//定义一个2维数组，记录每个结点的值int Max(int x,int y)//定义一个求最大值的算法{ return x=y?x:y;}int main(){ int i,j,n; cinn; for(i=1;i=n;i++) for(j=1;j=i;j++) cinArr[i][j];//按顺序输入数值 for(i=n-1;i=1;i--) for(j=1;j=i;j++) Arr[i][j]=Arr[i][j]+Max(Arr[i+1][j],Arr[i+1][j+1]); //从倒数第二层开始计算下一层相邻2点的最大值， //加上本身结点的值再保存 coutArr[1][1]endl;  return 0;} 测试数据 5 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 结果：3