Codeforces Round #353 (Div. 2) C.Money Transfers

C. Money Transfers

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 ai ( - 109 ≤ ai ≤ 109), 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 ai is equal to 0.

Output

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

Examples

input

3
5 0 -5

output

1

input

4
-1 0 1 0

output

2

input

4
1 2 3 -6

output

3

思路：要把金钱归零，可以把数字划分为多个圈，每个圈的数字之和为0，我们用逆向思维想想，那么最差的方案应该是自成一个大圈，需要操作n-1次。分的圈越多，需要的操作数越少，每个圈减去一个操作数。每个数字可以顺逆时针进行，分两种情况，顺时针组圈的话，那么一直累加，得到结果等于0，即是一个圈（0自成一个圈）。逆时针组圈的话，我们也是用逆向思维去解决，当一直累加，得到了两个相同的结果，意味着这两个位置之间可以组成一个圈，我们只需要哪种组圈方案圈的数目多，就是操作最少的方案了。

#include <iostream>
#include <map>
#include <algorithm>
using namespace std;
int main()
{
	map<long long, int> m;
	int n, t = 0;
	long long a, s = 0;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> a;
        	s += a;
		t = max(t, ++m[s]);
	}
	cout << n - t;
	return 0;
}

总结：1.多写几组样例，看清问题本质，抽象最优方案
           2.逆向思维