# CodeForces - 675C Money Transfers (map&技巧)

531人阅读 评论(0)

CodeForces - 675C
 Time Limit:                                                        1000MS Memory Limit:                                                        262144KB 64bit IO Format:                            %I64d & %I64u

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

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


Sample Output

Hint

Source

//题意：

Hait:这几个是两两相邻的，并且第一个与最后一个是相邻的，每次周转只能在两个相邻的银行之间进行。
//思路：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<map>
#define INF 0x3f3f3f3f
#define ll long long
#define M 1000000007
#define N 100010
using namespace std;
map<ll,int>mp;
int main()
{
int n,m;
while(scanf("%d",&n)!=EOF)
{
int ans=n-1;
ll sum=0;
for(int i=0;i<n;i++)
{
scanf("%d",&m);
sum+=m;
++mp[sum];
ans=min(ans,n-mp[sum]);
}
printf("%d\n",ans);
mp.clear();
}
return 0;
} 

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：262783次
• 积分：13339
• 等级：
• 排名：第1014名
• 原创：1116篇
• 转载：20篇
• 译文：0篇
• 评论：23条
阅读排行
最新评论