POJ 3176，1163 數字三角形

#include<iostream>#include<sstream>#include <string.h>using namespace std;int max (int a,int b){    return a>b? a:b;}int main(int argc , const char * argv[]){    int n;    cin>>n;    int a[350][350]={0};        for(int i =0;i < n; i++)    {        for (int j = 0;j<= i; j++)                    cin>>a[i][j];    }        int sum = 0;    for(int i =1;i < n; i++)    {        for (int j = 0;j<= i; j++)        {            if (j == 0)            {                a[i][j]=a[i-1][j]+a[i][j];            }            else if (j == i)            {                a[i][j]=a[i-1][j-1]+a[i][j];            }            else            {            a[i][j] =max(a[i-1][j],a[i-1][j-1])+a[i][j];            }        }    }        for (int i = 0; i <n ; i++)    {        if (a[n-1][i]>sum)        {            sum = a[n-1][i];        }    }    cout<<sum;}