codeforces 675C

标签是有个datastruct，but！ 这是个纯思维题。。

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 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.

Examples

Input

3
5 0 -5

Output

1

Input

4
-1 0 1 0

Output

2

Input

4
1 2 3 -6

Output

3

Note

In the first sample, Vasya may transfer 5 from the first bank to the third.

In the second sample, Vasya may first transfer 1 from the third bank to the second, and then 1 from the second to the first.

In the third sample, the following sequence provides the optimal answer:

1. transfer 1 from the first bank to the second bank;
2. transfer 3 from the second bank to the third;
3. transfer 6 from the third bank to the fourth.

题意是这样，有n个银行和一个人，输入的是该人在每个银行的资产数（总资产是0）， 每次操作可以把一家银行的任意多钱转移到左右相邻的任一银行，问你，最少需要多少次操作才能使原序列归零？

下面是题解：

对于一个长度为n的区间（区间和为0），想要把它归零，那么要最多要做n - 1次操作

那么如果把该长度为n的区间分成两个长度分别为len1 和len2 的区间呢？（假设这两个区间的区间和也为0）。 两个区间各自的操作数是   len1 - 1  和    len2 - 1  对不对？ 那么总操作数为：   len1 + len2 - 2

同理，分成三个这样的区间呢？

那么分成k个这样的区间呢？  n - k 次操作对不对？

要使总操作数尽量小，那么这样的区间一定得尽量多是不是？ 就是k尽量大。  

这个时候我们可以用一个map记录这样的区间的个数（区间和为0的充要条件是区间两端点的前缀和相等即mp[si] == mp[sj]）那么这道题就做出来了

AC代码：

/*************************************************************************
    > File Name: 675c.cpp
    > Author: Triose
    > Mail: Triose@163.com 
    > Created Time: 2016年05月23日 星期一 21时21分37秒
 ************************************************************************/

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<map>
#include<set>
using namespace std;
//#define ONLINE_JUDGE
#define eps 1e-8
#define INF 0x7fffffff
#define inf 0x3f3f3f3f
#define rep(i,a) for(int (i)=0; i<(a);(i)++)
#define mem(a,b) (memset((a),b,sizeof(a)))
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define sfs(a) scanf("%s",a)
#define pf(a) printf("%d\n",a)
#define pfd(a,b) printf("%d %d\n",a,b)
#define pfs(a) printf("%s\n",a)
#define pfI(a) printf("%I64d\n",a)
#define enter putchar(10)
#define LL long long
const double PI = acos(-1.0);
const double E = exp(1.0);
template<class T> T gcd(T a, T b) { return b ? gcd(b, a%b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b)*b; }
template<class T> inline T Min(T a, T b) { return a<b ? a : b; }
template<class T> inline T Max(T a, T b) { return a>b ? a : b; }
int n, m;
LL s;
map<LL, int> mp;
int main() {
#ifndef ONLINE_JUDGE
	freopen("in.txt","r",stdin);
//	freopen("Out.txt", "w", stdout);
#endif
    while(cin >> n) {
	mp.clear();
	s = 0;
	int ans = n - 1;
	for(int i = 0; i < n; i++) {
	    cin >> m;
	    s += m;
	    mp[s]++;
	    ans = Min(ans, n - mp[s]);
	}
	cout << ans << endl;	
    }
    return 0;
}

所以用stl也是数据结构吧。。。。