Question
Given a sequence whose adjacent values never tie, locate the first element that rises above every neighbor it has. Report that element's position. ```python def solve(raw: str) -> str: ... ``` ## Requirements - The input is one line of space-separated integers with no count prefix, and it holds at least one value. - A position is a local maximum when its value is strictly greater than each neighbor that exists; the first and last positions have only one neighbor. - Return the zero-based index of the earliest such position as a decimal string. - A single-element sequence qualifies at index `0`. - Because neighbors never tie, at least one local maximum always exists and no equality rule is needed. - The contract asks for the earliest one, so a slope-following search that returns an arbitrary maximum is not sufficient. - `run_case` passes `case["stdin"]` to `solve`. - Do not append a trailing newline to the returned string; return the value exactly once.