usaco——numtri

Number Triangles

Consider the number triangle shown below. Write a program that calculates the highest sum of numbers that can be 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.

          7

        3   8

      8   1   0

    2   7   4   4

  4   5   2   6   5

In the sample above, the route from 7 to 3 to 8 to 7 to 5 produces the highest sum: 30.

PROGRAM NAME: numtri

INPUT FORMAT

The first line contains R (1 <= R <= 1000), the number of rows. Each subsequent line contains the integers for that particular row of the triangle. All the supplied integers are non-negative and no larger than 100.

SAMPLE INPUT (file numtri.in)

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

OUTPUT FORMAT

A single line containing the largest sum using the traversal specified.

SAMPLE OUTPUT (file numtri.out)

30
#include <iostream>
#include <fstream>
#include <string>

using namespace std;
    ofstream fout ("numtri.out");
    ifstream fin ("numtri.in");
inline int max(int a,int b)
{ return a>b?a:b;}
    int tri[1000][1000],memory[1000][1000];
inline void fmax(int a[],int size)
{  int max=a[0]; for(int i=0; i<size; ++i) if(max<a[i])  max=a[i];   fout<<max<<endl;}
void core(int size)
{  
   memory[0][0]=tri[0][0];
   for(int i=1; i<size; ++i)
      for(int j=0; j<i+1; ++j)
         if(j==0) memory[i][j]=memory[i-1][j]+tri[i][j];
         else if(j<i) memory[i][j]=max(memory[i-1][j]+tri[i][j],memory[i-1][j-1]+tri[i][j]);
         else memory[i][j]=memory[i-1][j-1]+tri[i][j];
   fmax(memory[size-1] , size);
}



int main()
{


    int size;
    fin>>size;
    for(int i=0; i<size; ++i)
       for(int j=0; j<i+1; ++j)
         fin>>tri[i][j];
    if(size==1) fout<<tri[0][0]<<endl;
    else
    core(size);
    return 0;
}