對於一個數列 $a_{1 \dots n}$，定義 $f(a)$ 為：
$$f(a) = \max_{1 \le l \le r \le n} \sum_{i=l}^{r} a_i$$
給定一個數列 $b_{1 \dots n}$，你需要將 $b_{1 \dots n}$ 重新排列得到 $b'_{1 \dots n}$，並使得 $f(b')$ 最小化。
第一行包含一個整數 $n$ ($1 \le n \le 16$)。 第二行包含 $n$ 個整數 $a_{1 \dots n}$ ($|a_i| \le 10^5$)。
輸出 $f(b')$ 的最小值。
4 1 -1 1 1
2
6 4 -4 5 -20 6 7
9
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: