codeforces 675 C. Money Transfers(思维、前缀和)

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

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

题目链接

http://codeforces.com/contest/675/problem/C

题目大意

有n个银行，a[i]表示这个人在第i个银行有a[i]块钱（可以是负数）,所有银行的钱加起来正好是0.每次只能在相邻的银行之间转账,问最少要转多少次就能使所有的a[i]的值为0。其中1和n相邻。

数据范围

n (1 ≤ n ≤ 100 000)
ai ( - 1e9 ≤ ai ≤ 1e9)

解题思路

银行总数减去前缀和出现最多的次数即为答案。
原理：把这一组数划分成若干小区间，使得每一个小区间的数的和为0。当区间数达到最多的时候，我们就找到了最优解，数只需要在每个小区间内变换就行了。用银行总数减去区间数就得到了转移的步数。要找到区间数，只要找出前缀和出现最多的次数，因为每次出现同样的前缀和时，就相当于出现了一个等于0 的区间。

解决代码

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<map>
using namespace std;
typedef long long ll;
int  a[100050];
int main()
{
	map<ll,ll>b;
    ll n,ans = 0,sum = 0;
    cin >> n;
    for(ll i = 1;i <= n;i++)
  	   scanf("%d",&a[i]);
    for(ll i = 1;i <= n;i++)
    {
		sum += a[i];
		b[sum]++;
		ans = max(ans,b[sum]);
    }
   cout <<n - ans<<endl;
    return 0;
}