P5146 Maximum Difference

HKE has recently been keen on studying sequences, and once he discovered an interesting problem: For a sequence $A_1,A_2,\cdots,A_n$, find two indices $i, j$ ($1\le i

The first line contains a positive integer $n$. The next $n$ lines each contain one integer. The integer on the $(i + 1)$-th line is $A_i$.

One line, the maximum value of $A_j-A_i$.

#### Constraints - For $30\%$ of the testdata, $n\le1000$. - For $70\%$ of the testdata, $n\le10^5$. - For $100\%$ of the testdata: $2\le n\le 10^6$, and $A_i$ is within the int range. Translated by ChatGPT 5