Maximum Subarray Sum After Multiplier
Pick one nonempty interval and scale it by k or divide it by k. Then find the best subarray, which may overlap the scaled interval or sit beside it.
Pick one nonempty interval and scale it by k or divide it by k. Then find the best subarray, which may overlap the scaled interval or sit beside it.