Problem Solving/백준

백준 2670 연속부분최대곱

minOE 2025. 7. 15. 17:12
728x90

https://www.acmicpc.net/problem/2670

 

n = int(input())
arr = [float(input()) for _ in range(n)]

dp = arr[0]
ans = arr[0]

for i in range(1, n):
    if dp == 0.0:
        dp = arr[i]
    else:
        dp *= arr[i]
        dp = max(dp, arr[i])
    ans = max(ans, dp)

print('%.3f' % ans)
728x90