1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
#pragma GCC optimize("Ofast")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define e1 first
#define e2 second
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define float long double
#define size(x) (int)x.size()
#define satori int testCases; cin>>testCases; while(testCases--)
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define all(r) begin(r),end(r)
#define time chrono::high_resolution_clock().now().time_since_epoch().count()
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
mt19937 rng(chrono::high_resolution_clock().now().time_since_epoch().count());
///////////////////
#define debug if(1)
///////////////////

const int MAXN=5e5+10,base=(1<<19),small_inf=1e9+2137;
const ll inf=1e18+2137;

int t[base*2];
ll a[MAXN];
vector<ll> vals;

int pos(ll x){
	return lower_bound(all(vals),x)-begin(vals)+1;
}

void update(int u,int v){
	u+=base;
	while(u)
		t[u]=max(t[u],v),u/=2;
}

int get(int l,int r){
	l+=base;
	r+=base;
	int result=max(t[l],t[r]);
	while(l/2!=r/2){
		if(l%2==0)
			result=max(result,t[l+1]);
		if(r%2==1)
			result=max(result,t[r-1]);
		l/=2;
		r/=2;
	}
	return result;
}

int32_t main()
{
	fastio;
	int n;
	ll csum=0;
	cin>>n;
	vals.eb(0ll);
	vals.eb(-inf);
	for(int i=0;i<base*2;i++)
		t[i]=-small_inf;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		csum+=a[i];
		vals.eb(csum);
	}
	sort(all(vals));
	update(pos(0ll),0);
	csum=0;
	int cpos=0,max_res=0;
	for(int i=1;i<=n;i++){
		csum+=a[i];
		cpos=pos(csum);
		max_res=get(0,cpos)+1;
		update(cpos,max_res);
	}
	if(max_res<0){
		cout<<"-1\n";
	}
	else
		cout<<n-max_res<<'\n';
}