[백준 2670: 연속부분최대곱] - C++

www.acmicpc.net/problem/2670

2670번: 연속부분최대곱

#include <iostream>
#include <algorithm> 
using namespace std;

int main()
{
	int n;
	cin >> n;
	double arr[10001] = { 0.f };
	double dp[10001] = { 0.f };

	for (int i = 1; i <= n; i++)
	{
		cin >> arr[i];
	}

	dp[1] = arr[1];
	double result = -1;

	for (int i = 2; i <= n; i++)
	{
		dp[i] = max(arr[i], arr[i] * dp[i - 1]);
		result = max(result, dp[i]);
	}

	printf("%.3f", result);
	return 0;


}