http://zhedahht.blog.163.com/blog/static/2541117420116135376632/
题目:在数组中,数字减去它右边的数字得到一个数对之差。求所有数对之差的最大值。例如在数组{2, 4, 1, 16, 7, 5, 11, 9}中,数对之差的最大值是11,是16减去5的结果。
动态规划:
diff[i]表示以arr[i]为减数的最大值,diff[i] (i=1..n-1 )的最大值即为所求
求diff[i + 1] 为arr[0]...arr[i]里的最大值减去arr[i+1]
int max_diff2(int arr[], int n)
{
//assert(arr != NULL && n > 1)
int maxval = arr[0];
int maxdiff = arr[0] - arr[1];
for (int i = 2; i < n; ++i)
{
if (maxval < arr[i - 1]) maxval = arr[i - 1];
int curDiff = maxval - arr[i];
if (curDiff > maxdiff) maxdiff = curDiff;
}
return maxdiff;
}
转化为最大子数组和:
arr[i] - arr[i-2] = (arr[i]-arr[i-1]) + (arr[i-1] - arr[i-2])
int max_diff(int arr[], int n)
{
//assert(arr != NULL && n > 1);
for (int i = 0; i < n - 1; i++)
{
arr[i] = arr[i] - arr[i + 1];
}
int curSum = arr[0];
int maxSum = arr[0];
for (int i = 1; i < n - 1; ++i)
{
if (curSum < 0) curSum = 0;
curSum += arr[i];
if (curSum > maxSum) maxSum = curSum;
}
return maxSum;
}