poj 1163 The Triangle

# include <stdio.h>

# define MAXN 100

short int a[MAXN][MAXN];

int main()
{
int n, i, j;

scanf("%d", &n);

for (i = 0; i < n; ++i)
for (j = 0; j <= i; ++j)
scanf("%d", &a[i][j]);

for (i = n-1; i > 0; --i)
for (j = 0; j <= i; ++j)
a[i-1][j] += (a[i][j]>a[i][j+1] ? a[i][j]:a[i][j+1]);

printf("%d\n", a[0][0]);

return 0;
}

# include <stdio.h>

short int a[100];

int main()
{
int n, i, j, t, k, max, u;

scanf("%d", &n);

for (i = 0; i < n; ++i)
for (t = j = 0; j <= i; ++j)
{
u = a[j];
scanf("%d", &k);
a[j] = k + (t>a[j] ? t:a[j]);
t = u;
}

max = a[0];
for (i = 0; i < n; ++i)
if (a[i] > max) max = a[i];

printf("%d\n", max);

return 0;
}