POJ 3176 Cow Bowling

 1/**//**************************************
 2Problem: POJ 3176 Cow Bowling
 3Time: 32MS
 4Memory: 4120K
 5Accepted Time: 2009-04-11 12:38:54
 6Tips:《程序设计导引及在线实践》10.1
 7**************************************/
 8#include <stdio.h>
 9int main()
10{
11    int n;
12    while(scanf("%d",&n)!=EOF)
13    {
14        int a[1009][1009],i,j;
15        for(i=1;i<=n;i++)
16        for(j=1;j<=i;j++)
17        scanf("%d",&a[i][j]);
18        int b[1009];
19        for(i=1;i<=n;i++)b[i]=a[n][i];
20        for(i=n-1;i>=1;i--)
21        {
22            for(j=1;j<=i;j++)
23            if(b[j]>b[j+1])
24            {
25                b[j]=b[j]+a[i][j];
26            }
27            else
28            {
29                b[j]=b[j+1]+a[i][j];
30            }
31        }
32        printf("%d\n",b[1]);
33    }
34    return 0;
35}
36