- Category:
- Data structs
- Tags:
-
- File Size:
- 2kb
- Update:
- 2017-11-27
- Downloads:
- 0 Times
- Uploaded by:
- 周冉
Description: Topic description:Given an array a[0,..., n-1], find its maximum sum of subarray (length >=1) Input description:The first row is an integer n (1<=n<=5000), and then n integers are entered sequentially (each integer range [-5000, 5000]) Output description:Output an integer representing the maximum subarray sum Sample input :5 1 -1 1 1 -1 Sample output:2
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| Lab-HM6
|
| Lab-HM6\6-1.cpp | 422 | 2017-11-13
|
| Lab-HM6\Debug
|
| Lab-HM6\Debug\Lab-HM6.tlog
|
| Lab-HM6\Lab-HM6.vcxproj | 5702 | 2017-11-13
|
| Lab-HM6\Lab-HM6.vcxproj.filters | 944 | 2017-11-13 |
Download