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
 93
 94
 95
 96
 97
 98
 99
100
101
102
#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef set<int> SI;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;

const int INF = 1000000001;
const LD EPS = 1e-9;
const int MOD = 1000000007;
const LL LLINF = 1000000000000000001;

#define FOR(i, b, e) for(int i = b; i <= e; i++)
#define FORD(i, b, e) for(int i = b; i >= e; i--)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define DPRINT(x) cout << #x << ": " << x << endl
#define BOOST ios_base::sync_with_stdio(false); cin.tie(nullptr)

#define MP make_pair
#define PB push_back
#define ST first
#define ND second
#define GGL(x) "Case #" << x << ": "

// ゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴゴ


void insertGood(map<LL, LL> &m, PLL elem)
{
    auto it = m.upper_bound(elem.ST);
    if (it != m.begin())
    {
        it--;
        if (elem.ND >= it->ND)
            return;
    }

    m[elem.ST] = elem.ND;
    it = m.find(elem.ST);
    it++;
    while (it != m.end() && it->ND >= elem.ND)
        it = m.erase(it);
}

LL getBestNotGreater(map<LL, LL> &m, LL v)
{
    auto it = m.upper_bound(v);
    if (it != m.begin())
    {
        it--;
        return it->ND;
    }
    else
        return LLINF;
}

int main()
{
    BOOST;
    
    int n;
    cin >> n;
    VLL v(n+1);
    VLL pre(n+1);
    VLL trueVal(n+1);
    FOR(i, 1, n)
    {
        cin >> v[i];
        pre[i] = pre[i-1] + v[i];
    }


    map<LL, LL> m = {{0, 0}};
    FOR(i, 1, n)
    {
        trueVal[i] = getBestNotGreater(m, pre[i]) + i - 1;
        if(v[i] >= 0)
            trueVal[i] = min(trueVal[i], trueVal[i-1]);
        insertGood(m, {pre[i], trueVal[i] - i});
    }

    LL ans = LLINF;
    FORD(i, n, 1)
    {
        ans = min(ans, trueVal[i]);
        if (v[i] < 0)
            break;
    }

    if (ans > INF)
        cout << "-1\n";
    else
        cout << ans << "\n";
}