Subarray Sums By Brute Force

Write max_subarray_brute(values: list[int]) -> int that returns the largest sum of any run of one or more adjacent elements, the brute-force way: the outer loop fixes a start, the inner loop extends an end one step at a time while a running total holds the sum of the current run, and best keeps the largest total seen. The list has at least one value, and the answer may be negative. This is O(n squared). Do NOT write a main block or any top-level test code; the tests construct the calls. Input: one line of space-separated integers; the tests print the value your function returns.