zoukankan      html  css  js  c++  java
  • POJ1163 The Triangle

    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 44997   Accepted: 27174

    Description

    7
    3 8
    8 1 0
    2 7 4 4
    4 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

    5
    7
    3 8
    8 1 0 
    2 7 4 4
    4 5 2 6 5

    Sample Output

    30

    Source

    入门水题233

     1 /**/
     2 #include<iostream>
     3 #include<cstdio>
     4 #include<cmath>
     5 #include<cstring>
     6 #include<algorithm>
     7 using namespace std;
     8 int a[200][200];
     9 int n;
    10 int main(){
    11     scanf("%d",&n);
    12     int i,j;
    13     for(i=1;i<=n;i++)
    14       for(j=1;j<=i;j++)
    15           scanf("%d",&a[i][j]);
    16     for(i=n-1;i;i--)
    17       for(j=1;j<=i;j++){
    18           a[i][j]+=max(a[i+1][j],a[i+1][j+1]);
    19       }
    20     printf("%d
    ",a[1][1]);
    21     return 0;
    22 }
  • 相关阅读:
    如何有效的写算法题的几个小tips
    题目
    记录加入博客园,申请开通cnblog
    关于套接字socket程序参数设置
    int main (int argc, const char * argv[0])及指针数组与数组指针
    sleep函数
    signal函数
    C htonl()函数
    位域unsigned char a:4
    关于TCP和UDP的一个理解
  • 原文地址:https://www.cnblogs.com/SilverNebula/p/5708574.html
Copyright © 2011-2022 走看看