Codeforces Round #353 (Div. 2) C. Money Transfers （思维题）

最新推荐文章于 2020-02-24 15:42:49 发布

lljjccsskk

最新推荐文章于 2020-02-24 15:42:49 发布

阅读量645

点赞数

分类专栏： codeforces

本文链接：https://blog.csdn.net/lljjccsskk/article/details/51458413

版权

codeforces 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

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.

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.

题意：

n个负担着不同债务的银行围成环，每次每个银行只能向自己左边或者右边的银行转移资金。所有银行的债务和为0，问你最少转移多少次能让所有银行债务都为0。

分析：

n个银行，最多n-1次即可将所有银行债务变为0，即按顺序从第一个开始向后一个银行转移债务即可，到第n个时所有债务必为0。

在此转移过程中可以发现任何一个为0的区间都可以减少1次转移，即该区间和为0时，右边界不需要向后一个银行继续转移债务。

数出存在多少个0区间即可得到答案为n-0区间个数。

假设区间[i,j]和为0，那么[1,i-1]的区间和与[1,j]和相同。

通过map存下区间和大小出现的次数，即可得到哪些区间为0。

但从1-n递推时是否没考虑到环？由于计算[1,x]（x从1-n）的区间和并存入map中，因此存在环的情况并不影响和的出现。

思路来自：http://m.blog.csdn.net/article/details?id=51438865

#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <fstream>
#include <vector>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
#define INF 0x3f3f3f3f
const int N=100005;
const int mod=1e9+7;

int a;
map<long long, int> findsum;

int main() {
    int n;
    long long sum=0;
    int ans=0;
    cin>>n;
    for (int i=0; i<n; i++) {
        scanf("%d",&a);
        sum+=a;
        ans=max(ans, ++findsum[sum]);
    }
    cout<<n-ans<<endl;
    return 0;
}