第十二周 5.16 --- 5.22

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<iostream>
 4 #include<algorithm>
 5 #include<map>
 6 using namespace std;
 7 
 8 typedef long long LL;
 9 int n;
10 const int maxn = 1e6+5;
11 map<long long,int> h;
12 int a[maxn];
13 
14 int main(){
15     while(scanf("%d",&n) != EOF){
16         int x;
17         h.clear();
18         LL pre = 0LL;
19         int ans = 0;
20         for(int i = 1;i <= n;i++){
21             scanf("%d",&a[i]);
22             pre += 1LL*a[i];
23             h[pre]++;
24             ans = max(ans,h[pre]);
25         }
26         printf("%d\n",n-ans);
27     }
28     return 0;
29 }