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
#include <bits/stdc++.h>


using namespace std;


const long long INF = 1LL << 60;


int longestWeaklyIncrSubseq(const vector <long long> &vec) {
    if (vec.empty()) {
        return 0;
    }

    vector <long long> lowestEnd(vec.size(), INF);

    for (auto &x : vec) {
        *upper_bound(lowestEnd.begin(), lowestEnd.end(), x) = x;
    }

    return find(lowestEnd.begin(), lowestEnd.end(), INF) - lowestEnd.begin();
}


int solve(int n, const vector <long long> &need) {
    long long total = 0;
    for (auto &x : need) {
        total += x;
    }

    if (total < 0) {
        return -1;
    }

    vector <long long> vec;

    long long sum = 0;
    for (auto &x : need) {
        sum += x;

        if (sum >= 0 && sum <= total) {
            vec.push_back(sum);
        }
    }

    return n - longestWeaklyIncrSubseq(vec);
}


int main() {
    ios_base::sync_with_stdio(false);

    int n;
    cin >> n;

    vector <long long> need(n);
    for (auto &x : need) {
        cin >> x;
    }

    cout << solve(n, need) << '\n';

    return 0;
}