{"id":5425,"date":"2023-08-05T11:00:07","date_gmt":"2023-08-05T11:00:07","guid":{"rendered":"https:\/\/assignmenttask.com\/answers\/?p=5425"},"modified":"2024-01-16T11:12:22","modified_gmt":"2024-01-16T11:12:22","slug":"max-contiguous-subarray","status":"publish","type":"post","link":"https:\/\/assignmenttask.com\/answers\/max-contiguous-subarray\/","title":{"rendered":"Max Contiguous Subarray"},"content":{"rendered":"

Max Contiguous Subarray<\/strong><\/h2>\n

 <\/p>\n

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<\/p>\n

The input will contain space-separated integers, denoting the elements of the list. Output<\/p>\n

The output should be an integer. Explanation<\/p>\n

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

[2]<\/p>\n

[2, -4]<\/p>\n

[2, -4, 5]<\/p>\n

[2, -4, 5, -1]<\/p>\n

[2, -4, 5, -1, 2]<\/p>\n

[2, -4, 5, -1, 2, -3]<\/p>\n

[-4]<\/p>\n

[-4, 5]<\/p>\n

[-4, 5, -1]<\/p>\n

[-4, 5, -1, 2]<\/p>\n

[-4, 5, -1, 2, -3]<\/p>\n

[5]<\/p>\n

[5, -1]<\/p>\n

[5, -1, 2]<\/p>\n

[5, -1, 2, -3]<\/p>\n

[-1]<\/p>\n

[-1, 2]<\/p>\n

[-1, 2, -3]<\/p>\n

[2]<\/p>\n

[2, -3]<\/p>\n

[-3]<\/p>\n

Among the above contiguous sub-lists, the contiguous sub-list [5, -1, 2] has the largest sum which is 6.<\/p>\n

Sample Input 1<\/p>\n

2 -4 5 -1 2 -3<\/p>\n

Sample Output 1<\/p>\n

6<\/p>\n

Sample Input 2<\/p>\n

-2 -3 4 -1 -2 1 5 -3<\/p>\n

Sample Output 2<\/p>\n

7<\/p>\n

Answer:<\/strong><\/h3>\n

numbers = [int(item) for item in input().split()]<\/p>\n

maxSum = 0<\/p>\n

maxTemp = 0<\/p>\n

for i in range(0, len(numbers)):<\/p>\n

maxTemp += numbers[i]<\/p>\n

if maxTemp < 0:<\/p>\n

maxTemp = 0<\/p>\n

elif (maxSum < maxTemp):<\/p>\n

maxSum = maxTemp<\/p>\n

print(f'{maxSum}’)<\/p>\n

 <\/p>\n

Looking for Solutions?<\/strong><\/h3>\n

Get the best assignment assistance from experts.<\/p>\n

\"Order-Your-Assignment\"

Max Contiguous Subarray   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] Read More …<\/a><\/p>\n","protected":false},"author":3,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[729],"tags":[],"_links":{"self":[{"href":"https:\/\/assignmenttask.com\/answers\/wp-json\/wp\/v2\/posts\/5425"}],"collection":[{"href":"https:\/\/assignmenttask.com\/answers\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/assignmenttask.com\/answers\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/assignmenttask.com\/answers\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/assignmenttask.com\/answers\/wp-json\/wp\/v2\/comments?post=5425"}],"version-history":[{"count":1,"href":"https:\/\/assignmenttask.com\/answers\/wp-json\/wp\/v2\/posts\/5425\/revisions"}],"predecessor-version":[{"id":5427,"href":"https:\/\/assignmenttask.com\/answers\/wp-json\/wp\/v2\/posts\/5425\/revisions\/5427"}],"wp:attachment":[{"href":"https:\/\/assignmenttask.com\/answers\/wp-json\/wp\/v2\/media?parent=5425"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/assignmenttask.com\/answers\/wp-json\/wp\/v2\/categories?post=5425"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/assignmenttask.com\/answers\/wp-json\/wp\/v2\/tags?post=5425"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}