시간 제한메모리 제한제출정답맞힌 사람정답 비율
3 초 1024 MB168927454.412%

문제

FJ gave Bessie an array $a$ of length $N$ ($2\le N\le 500, -10^{15}\le a_i\le 10^{15}$) with all $\frac{N(N+1)}{2}$ contiguous subarray sums distinct. For each index $i\in [1,N]$, help Bessie compute the minimum amount it suffices to change $a_i$ by so that there are two different contiguous subarrays of $a$ with equal sum.

입력

The first line contains $N$.

The next line contains $a_1,\dots, a_N$ (the elements of $a$, in order).

출력

One line for each index $i\in [1,N]$.

예제 입력 1

2
2 -3

예제 출력 1

2
3

Decreasing $a_1$ by $2$ would result in $a_1+a_2=a_2$. Similarly, increasing $a_2$ by $3$ would result in $a_1+a_2=a_1$.

예제 입력 2

3
3 -10 4

예제 출력 2

1
6
1

Increasing $a_1$ or decreasing $a_3$ by $1$ would result in $a_1=a_3$. Increasing $a_2$ by $6$ would result in $a_1=a_1+a_2+a_3$.