
ANSWERS
Q1. O(n)
All arrays are 1 indexed.
arr[n] – array of profits and losses of each ship
First we find the sum of all elements before an element and store it in array c.
Then the maximum sum of subarray is the greatest element in c.
begin
read arr[n]
int c[n]
c[1]=arr[1]
Plagiarism Free Assignment Help
Expert Help With This Assignment — On Your Terms
✓ Native UK, USA & Australia writers
✓ Deadline from 3 hours
✓ 100% Plagiarism-Free — Turnitin included
✓ Unlimited free revisions
✓ Free to submit — compare quotes