← 返回 google 的题目列表Dynamic Programming Problems
类型：online_judge
Solve a dynamic programming problem. For example, given an array, find the contiguous subarray with the maximum sum and return its sum. Assume the array length is between 1 and 100, and the numbers in the array range from -100 to 100.
Example
Input
1 2 3 -2 5