Codeforces Round #353 (Div. 2) C. Money Transfers（数学题）

K - Money Transfers

Time Limit:1000MS    Memory Limit:262144KB    64bit IO Format:%I64d & %I64u

Description

There are n banks in the city where Vasya lives, they are located in a circle, such that any two banks are neighbouring if their indices differ by no more than 1. Also, bank 1 and bank n are neighbours if n > 1. No bank is a neighbour of itself.

Vasya has an account in each bank. Its balance may be negative, meaning Vasya owes some money to this bank.

There is only one type of operations available: transfer some amount of money from any bank to account in any neighbouring bank. There are no restrictions on the size of the sum being transferred or balance requirements to perform this operation.

Vasya doesn't like to deal with large numbers, so he asks you to determine the minimum number of operations required to change the balance of each bank account to zero. It's guaranteed, that this is possible to achieve, that is, the total balance of Vasya in all banks is equal to zero.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — the number of banks.

The second line contains n integers a_i ( - 10⁹ ≤ a_i ≤ 10⁹), the i-th of them is equal to the initial balance of the account in the i-th bank. It's guaranteed that the sum of all a_i is equal to 0.

Output

Print the minimum number of operations required to change balance in each bank to zero.

Sample Input

Input

3
5 0 -5

Output

1

Input

4
-1 0 1 0

Output

2

Input

4
1 2 3 -6

Output

3
题意：
n个有着不同财产（可正可负），每次每个银行只能向紧邻自己的银行转移资金。所有银行的财产和为0，问你最少转移多少次能让所有银行债务都为0。
分析：
（1）n个银行，最多n-1次即可将所有银行债务变为0，即按顺序从第一个开始向后一个银行转移债务即可，到第n个时所有债务必为0。
（2）在此转移过程中可以发现任何一个为0的区间都可以减少1次转移（区间和为0时，右边不需要向后一个银行继续转移债务），数出存在sum个0区间即可得到区间个数为n-sum。
（3）假设区间[i,j]和为0，那么[1,i-1]的区间和与[1,j]和相同。
（4）通过map存下区间和大小出现的次数，即可得到哪些区间为0。
代码：
#include <iostream>
#include <cstdio>
#include <map>
using namespace std;
int a;
map<long long, int> num_zero;
int main() {
    int n;
    long long sum=0;
    int ans=0;
    cin>>n;
    for (int i=0; i<n; i++) {
        scanf("%d",&a);
        sum+=a;
        ans=max(ans, ++num_zero[sum]);
    }
    cout<<n-ans<<endl;
    return 0;
}