1462D.md (3299B)
1 Source: https://codeforces.com/problemset/problem/1462/D 2 3 D. Add to Neighbour and Remove 4 5 time limit per test 6 7 3 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 Polycarp was given an array of $a[1 \dots n]$ of $n$ integers. He can perform the following operation with the array $a$ no more than $n$ times: 22 23 * Polycarp selects the index $i$ and adds the value $a_i$ to one of his choice of its neighbors. More formally, Polycarp adds the value of $a_i$ to $a_{i-1}$ or to $a_{i+1}$ (if such a neighbor does not exist, then it is impossible to add to it). 24 * After adding it, Polycarp removes the $i$-th element from the $a$ array. During this step the length of $a$ is decreased by $1$. 25 26 The two items above together denote one single operation. 27 28 For example, if Polycarp has an array $a = [3, 1, 6, 6, 2]$, then it can perform the following sequence of operations with it: 29 30 * Polycarp selects $i = 2$ and adds the value $a_i$ to $(i-1)$-th element: $a = [4, 6, 6, 2]$. 31 * Polycarp selects $i = 1$ and adds the value $a_i$ to $(i+1)$-th element: $a = [10, 6, 2]$. 32 * Polycarp selects $i = 3$ and adds the value $a_i$ to $(i-1)$-th element: $a = [10, 8]$. 33 * Polycarp selects $i = 2$ and adds the value $a_i$ to $(i-1)$-th element: $a = [18]$. 34 35 Note that Polycarp could stop performing operations at any time. 36 37 Polycarp wondered how many minimum operations he would need to perform to make all the elements of $a$ equal (i.e., he wants all $a_i$ are equal to each other). 38 39 Input 40 41 The first line contains a single integer $t$ ($1 \leq t \leq 3000$) — the number of test cases in the test. Then $t$ test cases follow. 42 43 The first line of each test case contains a single integer $n$ ($1 \leq n \leq 3000$) — the length of the array. The next line contains $n$ integers $a_1, a_2, \ldots, a_n$ ($1 \leq a_i \leq 10^5$) — array $a$. 44 45 It is guaranteed that the sum of $n$ over all test cases does not exceed $3000$. 46 47 Output 48 49 For each test case, output a single number — the minimum number of operations that Polycarp needs to perform so that all elements of the $a$ array are the same (equal). 50 51 Example 52 53 Input 54 55 ``` 56 4 57 5 58 3 1 6 6 2 59 4 60 1 2 2 1 61 3 62 2 2 2 63 4 64 6 3 2 1 65 ``` 66 67 Output 68 69 ``` 70 4 71 2 72 0 73 2 74 ``` 75 76 Note 77 78 In the first test case of the example, the answer can be constructed like this (just one way among many other ways): 79 80 $[3, 1, 6, 6, 2]$ $\xrightarrow[]{i=4,~add~to~left}$ $[3, 1, 12, 2]$ $\xrightarrow[]{i=2,~add~to~right}$ $[3, 13, 2]$ $\xrightarrow[]{i=1,~add~to~right}$ $[16, 2]$ $\xrightarrow[]{i=2,~add~to~left}$ $[18]$. All elements of the array $[18]$ are the same. 81 82 In the second test case of the example, the answer can be constructed like this (just one way among other ways): 83 84 $[1, 2, 2, 1]$ $\xrightarrow[]{i=1,~add~to~right}$ $[3, 2, 1]$ $\xrightarrow[]{i=3,~add~to~left}$ $[3, 3]$. All elements of the array $[3, 3]$ are the same. 85 86 In the third test case of the example, Polycarp doesn't need to perform any operations since $[2, 2, 2]$ contains equal (same) elements only. 87 88 In the fourth test case of the example, the answer can be constructed like this (just one way among other ways): 89 90 $[6, 3, 2, 1]$ $\xrightarrow[]{i=3,~add~to~right}$ $[6, 3, 3]$ $\xrightarrow[]{i=3,~add~to~left}$ $[6, 6]$. All elements of the array $[6, 6]$ are the same.