Dynamic Programming - Max Subsequence Sum (C)

分享一个大牛的人工智能教程。零基础！通俗易懂！风趣幽默！希望你也加入到人工智能的队伍中来！请点击人工智能教程

/*
 * MaxSubsequenceSum.c - by Peace
 */

#include <stdio.h>
#include <stdlib.h>

#define MIN_VALUE -32768

static int Max(int a, int b)
{
	return a > b ? a : b;
}

static int MaxSubsequenceSum(const int nums[], int n)
{
	// 以nums[i]为结尾的最大子数组和为dp[i]
	int* dp = (int*)malloc(n * sizeof(int));

	// 第一个元素前面没有子数组
	dp[0] = nums[0];

	// 状态转移方程
	for (int i = 1; i < n; i++)
	{
		// dp[i]有两种选择：
		// 要么与前面的相邻子数组连接，形成一个和更大的子数组；
		// 要么不与前面的子数组连接，自己作为一个子数组。
		dp[i] = Max(nums[i], dp[i - 1] + nums[i]);
	}

	// 计算nums的最大子数组和
	int r = MIN_VALUE;
	for (int i = 0; i < n; i++)
	{
		r = Max(r, dp[i]);
	}
	return r;
}

main_MaxSubsequenceSum()
{
	int nums1[] = { -4, -3, -5, -2, -1, -2, -6, -2 };
	printf("Sum1 = %d\n", MaxSubsequenceSum(nums1, sizeof(nums1) / sizeof(nums1[0])));

	int nums2[] = { 4, -3, 5, -2, -1, 2, 6, -2 };
	printf("Sum2 = %d\n", MaxSubsequenceSum(nums2, sizeof(nums2) / sizeof(nums2[0])));

	int nums3[] = { -2, 1, -3, 4, -1, 2, 1, -5, 4 };
	printf("Sum3 = %d\n", MaxSubsequenceSum(nums3, sizeof(nums3) / sizeof(nums3[0])));

	int nums4[] = { 2, 3, 6, 1, 2, 7, 1, 3, 6 };
	printf("Sum4 = %d\n", MaxSubsequenceSum(nums4, sizeof(nums4) / sizeof(nums4[0])));

	return 0;
}

// Output:
/*
Sum1 = -1
Sum2 = 11
Sum3 = 6
Sum4 = 31
*/