{33, 36, -73, 15, 43, -17, 36, -28, -1, 21} 1단계 : 배열 초기화 //초기화 public static void calculate_max(int[] s, int n){ for(int i=1; i < n; i++){ System.out.println("c[" + i + "] = max( s["+i+"], (s[" + i + "] + c[" + (i-1) + "] ) )"); c[i] = max( s[i] , (s[i] + c[i-1]) ); } System.out.println(); System.out.printf("a[] : "); view1(a); System.out.printf("c[] : "); view1(c); } c[1] = max( s[1], c[0] ) c[..