Codeforce - 675 - C. Money Transfers

C. Money Transfers
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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
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 。求最少步数。

AC代码思路：当出现一段数之和为 0 ，所需移动的步数 -1。所以要让圈中为 0 的段数尽可能多。

AC代码：

#include <iostream>
using namespace std;

int main()
{
    int n;cin>>n;
    int ans=0,k=0;
    long long a[n+5];
    for (int i=1;i<=n;i++)
    {
        cin>>a[i];
        if (!a[i]) k++;
        else
        {
            a[i]+=a[i-1];
            if (!a[i]) k++;
        }
    }
    cout<<n-k;
}