CF1285B Just Eat It!

### 题意简述 给定长度为 $n$ 的数列 $a=[a_1,a_2,...,a_n]$。 Yasser 会选择所有的 $n$ 个数，并算出它们的和 $\sum a_i$。 Adel 会选择两个正整数 $l,r(1\leq l \leq r \leq n)$，并算出 $\sum_{i=l}^{r} a_i$。Adel 不能选择 $l=1,r=n$。 如果 Yasser 算出的和在任意情况下（即 Adel 选取任意的 $l,r$ 都是如此）**严格大于** Adel 算出的，那么 Yasser 会开心。否则 Yasser 不会开心。 请你判断 Yasser 是否开心。

**本题有多组数据**。 第一行一个正整数 $t(1\leq t \leq 10^4)$，表示数据的组数。 对于每组数据，第一行一个正整数 $n(2\leq n \leq 10^5)$。 接下来一行 $a_1,a_2,...,a_n(-10^{9} \leq a_i \leq 10^9)$。 保证 $\sum n$ 不会超过 $10^5$。

对于每组数据，如果 Yasser 会开心，输出 `YES`，否则输出 `NO`。 翻译贡献者 U108949

In the first example, the total tastiness of any segment Adel can choose is less than the total tastiness of all cupcakes. In the second example, Adel will choose the segment $ [1, 2] $ with total tastiness $ 11 $ , which is not less than the total tastiness of all cupcakes, which is $ 10 $ . In the third example, Adel can choose the segment $ [3, 3] $ with total tastiness of $ 5 $ . Note that Yasser's cupcakes' total tastiness is also $ 5 $ , so in that case, the total tastiness of Yasser's cupcakes isn't strictly greater than the total tastiness of Adel's cupcakes.