Bird and Maximum Fruit-Gathering Problem Statement

A ninja bird can gather fruits from trees arranged in a circle. Each tree has an associated fruit value. The bird can gather all the fruits from a tree in 0.5 seconds and move to an adjacent tree in another 0.5 seconds. Once moved away, the bird cannot return to the same tree for more fruits.

Your task is to determine the maximum number of fruits the bird can collect within a given time frame, starting from any tree.

Input:

N = 7 M = 3
ARR[] = { 2, 1, 3, 5, 0, 1, 4 }

Output:

9

Example:

Explanation: The bird can start from tree 1 and move to tree 2 and then tree 3, collecting 1 + 3 + 5 = 9 fruits in total.

Constraints:

• 1 <= T <= 100
• 1 <= M <= 5000
• 1 <= N <= 5000
• 1 <= ARR[i] <= 5000