国产探花免费观看_亚洲丰满少妇自慰呻吟_97日韩有码在线_资源在线日韩欧美_一区二区精品毛片,辰东完美世界有声小说,欢乐颂第一季,yy玄幻小说排行榜完本

首頁 > 學院 > 開發設計 > 正文

B - The Triangle

2019-11-11 04:30:22
字體:
來源:轉載
供稿:網友

        7      3   8    8   1   0  2   7   4   44   5   2   6   5(Figure 1)Figure 1 shows a number triangle. Write a PRogram that calculates the highest sum of numbers passed on a route that starts at the top and ends somewhere on the base. Each step can go either diagonally down to the left or diagonally down to the right.         Input       Your program is to read from standard input. The first line contains one integer N: the number of rows in the triangle. The following N lines describe the data of the triangle. The number of rows in the triangle is > 1 but <= 100. The numbers in the triangle, all integers, are between 0 and 99.        Output       Your program is to write to standard output. The highest sum is written as an integer.       Sample Input
573 88 1 0 2 7 4 44 5 2 6 5Sample Output
30
題目意思:從頂端往下加求最大的那一條路。
思路可以采用逆向思維的方法,用替換。舉個例子,以上的為例,第四行2+4>2+5,7+5>7+2.......然后就變成了
        7      3   8    8   1   0
   7  12  10 10
依次類推求出最大。
代碼:
#include<cstdio>#define Max 105using namespace std;int main(){    int a[Max][Max];    int i,j,n;    while(~scanf("%d",&n))    {        for(i=0;i<n;i++)        {            for(j=0;j<=i;j++)            {                scanf("%d",&a[i][j]);            }        }        for(i=n-2;i>=0;i--)        {            for(j=0;j<=i;j++)            {                a[i][j]+=a[i+1][j]>a[i+1][j+1]?a[i+1][j]:a[i+1][j+1];            }        }        printf("%d/n",a[0][0]);    }    return 0;}

發表評論 共有條評論
用戶名: 密碼:
驗證碼: 匿名發表
主站蜘蛛池模板: 曲阜市| 拜泉县| 敦化市| 通州市| 历史| 广河县| 丰台区| 彭山县| 吕梁市| 酉阳| 鸡西市| 绵阳市| 镶黄旗| 盐山县| 曲周县| 东乡族自治县| 常山县| 哈尔滨市| 明星| 宜都市| 陇西县| 砚山县| 牙克石市| 元朗区| 大理市| 越西县| 山东省| 东乌| 娄底市| 镇赉县| 武胜县| 沙河市| 潼南县| 崇明县| 福海县| 喀喇沁旗| 共和县| 南投市| 桂林市| 潞西市| 永安市|