The site's wording is ambiguous, as its commentary says: for one given sequence the maximum is a finite computation, and the wording names neither a normalization nor the extremal quantity to be found. The precise Statement replaces the object of "Determine", the maximum itself, with "the largest constant $c$ such that, for all such sequences," that maximum exceeds $(c-o(1))\frac{1}{\sqrt{n}}\sum x_i$. The ambiguity is already in Erdős's text: [Er71, item 22], on the card Erdős 1971, asks only to determine $\max(\sum x_{i_r})$ over the monotonic subsequences of $n$ distinct numbers and calls the question unsettled, and Steele's survey [St95, Section 12] and Problem 3.4 of [TWY16] repeat that form. The inserted words are the site's: its commentary adopts this precise question, posed by Wouter van Doorn in the site's thread on 12 September 2025 after discussion with Desmond Weisenberg and Stijn Cambie, and the site's label SOLVED (LEAN), with the answer $c=1$, describes it. The commentary states the question for all sequences of $n$ reals; the precise Statement keeps the site's distinct reals. The normalization agrees with a weighted question of Erdős that Steele reports in the same section, citing Chung (1980, p. 278): to determine $\tau(n,0)$, the least over nonnegative weights $w_1,\ldots,w_n$ with sum $1$ of the largest sum of the weights along a monotone subsequence, which Steele expects to satisfy $\tau(n,0)\sqrt n\to1$. No result about the wording before it was made precise is recorded.