shine's dev log

1. Maximum-subarray 코드 def FindMaximumSubarray(A, low, high): if high < low: return 0, 0, 0 if high == low: return low, high, A[low] else: mid = (low + high) // 2 (left_low, left_high, left_sum) = FindMaximumSubarray(A, low, mid - 1) (right_low, right_high, right_sum) = FindMaximumSubarray(A, mid + 1, high) (cross_low, cross_high, cross_sum) = FindMaxCrossingSubarray(A, low, mid, high) if left_s..