A farmer uses pivot irrigation to water a circular field of crops. Due to varying conditions,...

 

Transcribed Image Text:

A farmer uses pivot irrigation to water a circular field of crops. Due to varying conditions, the field does not produce consistently. The farmer wants to achieve maximum profit using limited resources for harvest. The field is segmented into a number of equal segments, and a profit is calculated for each segment. This profit is the cost to harvest versus the sale priceC the produce. The farmer will harvest a number of contiguous segments along with those opposite. Determine the maximum profit the farmer can achieve. For example, the field is divided inton=6 sections and will select k = 2 contiguous sections and those opposite for harvest. The profit estimates are profit = [1, 5, 1, 3, 7, -3] respectively. The diagrams below show the possible choices with profits/0J at the 9 o'clock position and filling counterclockwise. -3 7 -3 -3 7 3 1 5 1 1 5 The profit levels, from left to right, are 1 +5 +7 + 3 = 16, 5 + 1+ 7+3 = 10, and 1+3+ -3 +1-2. The maximum profit is 16. Function Description Complete the function maxProfit in the editor below. The function must return the maximum profit achievable. maxProfit has the follawing parameters: k an integer denoting the half of the needed amount of pleces of the burger m kannsting cach of the pieces 3. 3. 1 havesting each of the pieces Constraints • 1sksn/ 2 • 2sns 105 •nis even • Os profitți] s 10°, where 0 sis n-1 v Input Format For Custom Testing The first line contains a single integer k. The second line contains a single integer n, the number of elements in profit. Each of the next n lines contains an integer, profitfi). v Sample Case 0 Sample Input For Custom Testing 3. -5 Sample Output MacBook Air A farmer uses pivot irrigation to water a circular field of crops. Due to varying conditions, the field does not produce consistently. The farmer wants to achieve maximum profit using limited resources for harvest. The field is segmented into a number of equal segments, and a profit is calculated for each segment. This profit is the cost to harvest versus the sale priceC the produce. The farmer will harvest a number of contiguous segments along with those opposite. Determine the maximum profit the farmer can achieve. For example, the field is divided inton=6 sections and will select k = 2 contiguous sections and those opposite for harvest. The profit estimates are profit = [1, 5, 1, 3, 7, -3] respectively. The diagrams below show the possible choices with profits/0J at the 9 o'clock position and filling counterclockwise. -3 7 -3 -3 7 3 1 5 1 1 5 The profit levels, from left to right, are 1 +5 +7 + 3 = 16, 5 + 1+ 7+3 = 10, and 1+3+ -3 +1-2. The maximum profit is 16. Function Description Complete the function maxProfit in the editor below. The function must return the maximum profit achievable. maxProfit has the follawing parameters: k an integer denoting the half of the needed amount of pleces of the burger m kannsting cach of the pieces 3. 3. 1 havesting each of the pieces Constraints • 1sksn/ 2 • 2sns 105 •nis even • Os profitți] s 10°, where 0 sis n-1 v Input Format For Custom Testing The first line contains a single integer k. The second line contains a single integer n, the number of elements in profit. Each of the next n lines contains an integer, profitfi). v Sample Case 0 Sample Input For Custom Testing 3. -5 Sample Output MacBook Air

Answer rating: 100% (QA)

include include this function ... View the full answer