cisco OA 新人求加米

1.
You are given a list of integers (both positive and negative). Find the continuous sequence of integers with the largest sum.

Write an algorithm to find the largest sum of the continuous sequence from the given list.

Input
The first line of input consists of an integer - inputArr_size, representing the size of the list (N).
The next line consists of N space-separated integers representing the elements of the list.

Output
Print an integer representing the largest sum of the continuous sequence from the given list.

Example
Input:
6
2 -8 3 -2 4 -10
Output:
5
Explanation:
The given list is (2, -8, 3, -2, 4, -10), and we take (3, -2, 4) as the continuous sequence for getting the largest sum. The sum is 3+ (-2) +4, which is 5.

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

ng over the terrain once.

Note
A path is valid path if, more than one drop points are connected (Single coordinate don't create any path, so pilot cannot fly over it).

Constraints
1 < N, M ≤ 700 (where N is always equal to M)

Example
Input:
5
2 3 2 4 2
5
2 2 6 5 8
Output:
3
Explanation:
There are 5 coordinates- (2,2), (3,2), (2,6), (4,5) and (2,8).
The best path is the horizontal one covering (2,2), (2,6) and (2,8).
So, the output is 3.