Problem 1756

1. Key Claim: Suppose $i, i+1, \ldots, i+k-1$ are all good, and $i+k$ is bad. Then,
$$a_i + a_{i+1} + \cdots + a_{i+k-1} \ge 0.$$

2. Proof of Key Claim: We proceed by induction on $k$.

- Base Case: For $k = 0$, the statement $0 \ge 0$ is trivially true.

- Inductive Step: Assume the claim holds for $k-1$. We need to show it holds for $k$.

Since $i$ is good, there exists some $1 \le \ell \le m$ such that
$$a_i + a_{i+1} + \cdots + a_{i+\ell-1} \ge 0.$$
We consider two cases:

- Case 1: $1 \le \ell \le k$. By the induction hypothesis, we have
$$a_{i+\ell} + a_{i+\ell+1} + \cdots + a_{i+k-1} \ge 0.$$
Adding these two inequalities, we get
$$a_i + a_{i+1} + \cdots + a_{i+k-1} \ge 0.$$

- Case 2: $\ell \ge k+1$. Since $i+k$ is bad, we have
$$a_{i+k} + a_{i+k+1} + \cdots + a_{i+\ell-1} < 0.$$
Therefore,
$$a_i + a_{i+1} + \cdots + a_{i+k-1} \ge -(a_{i+k} + a_{i+k+1} + \cdots + a_{i+\ell-1}) > 0.$$
Thus, the claim holds in both cases.

$\blacksquare$

3. **Handling the Case $|T| < n$**: If $|T| < n$, we can split $T$ into contiguous blocks. By the key claim, the sum of $a_i$ over each block is nonnegative. Therefore, the total sum $\sum_{k \in T} a_k \ge 0$.

4. **Handling the Case $|T| = n$**: If all indices are good, we use induction on $m$.

- Base Case: For $m = 1$, every $a_i \ge 0$, so $\sum_{k \in T} a_k \ge 0$.

- Inductive Step: Assume the statement holds for $m-1$. We need to show it holds for $m$.

Let $S$ be the set of indices that are good but become bad when $m$ is replaced with $m-1$. We have the following claims:

- Claim 1: If $i \in S$, then for any $j \in [i+1, i+m-1]$,
$$a_j + a_{j+1} + \cdots + a_{i+m-1} \ge 0.$$

- Claim 2: If $i \not\in S$, there exists some $j$ such that
$$a_i + a_{i+1} + \cdots + a_j \ge 0,$$
and none of $i, i+1, \ldots, j$ are in $S$.

Proof of Claim 1: This follows from the fact that $a_i + \cdots + a_{j-1} < 0$ and $a_i + \cdots + a_{i+m-1} \ge 0$.

Proof of Claim 2: Suppose the smallest $j$ such that $a_i + a_{i+1} + \cdots + a_j \ge 0$ satisfies $\ell \in S$ for some $\ell \in [i, j]$. Then,
$$a_\ell + \cdots + a_j < 0,$$
so
$$a_i + \cdots + a_{\ell-1} \ge 0.$$
We can keep removing elements like this until none of the indices are in $S$.

Back to the induction: The first part of the claim implies that the intervals $[i, i+m-1]$ are disjoint for $i \in S$, so the sum of $a_i$ for those intervals is nonnegative. The rest of the indices have sums that are nonnegative and do not go into these intervals. Thus, we may delete these intervals, and the problem reduces to the case where all the indices are good with $m$ replaced with $m-1$. The inductive hypothesis now finishes the proof.

$\blacksquare$

The final answer is $\boxed{ \sum_{k \in T} a_k \ge 0 }$.