Answer to Question #238393 in Python for sai krishna

Question

Given a list of integers, write a program to identify the contiguous sub-list that has the largest sum and print the sum. Any non-empty slice of the list with step size 1 can be considered as a contiguous sub-list.

Input

The input will contain space-separated integers, denoting the elements of the list.

Output

The output should be an integer.

Explanation

For example, if the given list is [2, -4, 5, -1, 2, -3], then all the possible contiguous sub-lists will be,

[2]

[2, -4]

[2, -4, 5]

[2, -4, 5, -1]

[2, -4, 5, -1, 2]

[-4]

[-4, 5]

[-4, 5, -1]

[-4, 5, -1, 2]

[5]

[5, -1]

[5, -1, 2]

[-1]

[-1, 2]

[2]

Among the above contiguous sub-lists, the contiguous sub-list [5, -1, 2] has the largest sum which is 6.

Sample Input 1

2 -4 5 -1 2 -3

Sample Output 1

6

Sample Input 2

-2 -3 4 -1 -2 1 5 -3

Sample Output 2

7

Answer 1

def max_sum(arr):
    rlt = arr[0]
    n = len(arr)
    for i  in range(n):
        for j in range(i,n):
            if sum(arr[i:j]) > rlt:
                rlt =  sum(arr[i:j])
    return rlt             
#2 -4 5 -1 2 -3
l1 = []
n = int(input("Enter the length of the list: "))
print("Enter the element of the list:")
for i in range(n):
    l1.append(int(input()))
print(max_sum(l1))