NYOJ 18

http://acm.nyist.net/JudgeOnline/problem.php?pid=18

 

#include<stdio.h>
#include<stdlib.h>
int max(int a,int b)
{
  return a>b?a:b ;  
}
int main()
{
    int t,i,j,n,a[110][110]={0};
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
     for(j=1;j<=i;j++)
     {
       scanf("%d",&a[i][j]);
     
       t=max(a[i-1][j-1],a[i-1][j]);
       a[i][j]+=t;
     }
    }
    int m=0;
    for(j=1;j<=n;j++)
    {
     if(a[n][j]>m)
     m=a[n][j];
    }
    printf("%d\n",m);
    //system("pause");
    return 0;
}