[UVa]11059:Maximum Product

直接Brute Force去尋找乘積最大的連續數字。

[C](0.012)

	#include<stdio.h>
	int main()
	{
	int N;
	int M = 1;
	while( scanf( "%d", &N ) != EOF )
	{
	long long S[20] = {0};
	int i;
	for( i = 0 ; i < N ; i++ )
	scanf( "%lld", &S[i] );
	long long P = 0, temp;
	int j;
	for( i = 0 ; i < N ; i++ )
	{
	temp = S[i];
	P = ( temp > P ) ? temp : P;
	for( j = i+1 ; j < N ; j++ )
	{
	temp *= S[j];
	P = ( temp > P ) ? temp : P;
	}
	}
	printf( "Case #%d: The maximum product is %lld.\n\n", M++, P );
	}
	return 0;
	}

view raw UVa11059.c hosted with ❤ by GitHub