Codeforces--675C--Money Transfers（思维）



Money Transfers

Time Limit: 1000MS

Memory Limit: 262144KB

64bit IO Format: %I64d & %I64u

Submit Status

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

Source

Codeforces Round #353 (Div. 2)

题意：一个人在很多家银行中都有存款，有正有负，负的代表欠钱，相邻的两家银行之间可以互相转账，第一家还有最后一家可以互相转，问最少需要几次可以使得银行的存款都变成0

将这n家银行看做一个环，其实就是将这n家银行分为k个和为零的区间，每个区间的价换次数我们是可以计算出来的，可以通过计算前缀和来表示可以分为多少个区间，如果sum[i]==sum[j]说明中间出现了一次0

#include<cstdio>
#include<map>
#include<cstring>
#include<algorithm>
using namespace std;
int num[100000+10];
map<long long,int>fp;
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		memset(num,0,sizeof(num));
		for(int i=1;i<=n;i++)
		scanf("%d",&num[i]);
		fp.clear();
		int ans=n-1;
		long long sum=0;
		for(int i=1;i<=n;i++)
		{
			sum+=num[i];
			fp[sum]++;
//			printf("%d\n",sum);
			ans=min(ans,n-fp[sum]);
		}
		printf("%d\n",ans);
	}
	return 0;
}