#PU1305. USACO 2023 February Contest, Gold — Problem 1. Equal Sum Subarrays
USACO 2023 February Contest, Gold — Problem 1. Equal Sum Subarrays
USACO 2023 February Contest, Gold — Problem 1. Equal Sum Subarrays
题目描述
Note: The time limit for this problem is 3s, 1.5x the default. FJ gave Bessie an array of length () with all contiguous subarray sums distinct. For each index , help Bessie compute the minimum amount it suffices to change by so that there are two different contiguous subarrays of with equal sum.
输入格式
The first line contains . The next line contains (the elements of , in order).
输出格式
One line for each index .
数据范围
(见题面原文)
样例
样例 1
2
2 -3
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
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$.