joj 2511

 

1. Sample Input

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

   Sample Output

   16
   12
   

   #include <iostream>
2. using namespace std;
3. int a [ 102 ] [ 102 ];
4.  
5. int max ( int x, int y )
6. {
7. if ( x > y )
8. {
9. return x;
10. }
11. return y;
12. }
13. int main ( )
14. {
15. int i, j, x, y, n;
16. while ( cin >> n )
17. {
18. for ( i = 0; i < n; i++ )
19. {
20. for ( j = 0; j <= i; j++ )
21. {
22. cin >> a [i ] [j ];
23. }
24. }
25. // cout << a[0][0] << endl;
26. for (i = n -2; i >= 0; i-- )
27. {
28. for ( j = 0; j <= i; j++ )
29. {
30. x = a [i ] [j ] + a [i +1 ] [j ];
31. y = a [i ] [j ] + a [i +1 ] [j +1 ];
32. // cout << x << " " << y << endl;
33. a [i ] [j ] = max (x, y );
34. }
35. }
36. cout << a [ 0 ] [ 0 ] << endl;
37. }
38. return 0;
39. }