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
#include <iostream>
#include <set>
#include <vector>
#include <climits>

using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n;

    cin >> n;

    
    long long elem, dist;
    dist = 0;

    pair<long long, long long> baseVal = { 0, 0 };
    set<pair<long long, long long>> perms; //wartosc - koszt
    vector<pair<long long, long long>> toDelete;

    while (n--)
    {
        cin >> elem;

        dist++;

        if (elem != 0)
        {
            if (!perms.empty())
            {
                auto et = perms.lower_bound({ -baseVal.first, LLONG_MIN });

                if (et != perms.end())
                {
                    perms.insert({ -baseVal.first, et->second - dist }); //najmniejszy koszt z wartoscia nieujemna
                    
                    toDelete.clear();

                    set<pair<long long, long long> >::reverse_iterator it = make_reverse_iterator(et);
                    it++;

                    for (; it != perms.rend(); it++)
                    {
                        if (it->second >= et->second - dist)
                        {
                            toDelete.push_back(*it);
                        }
                        else
                        {
                            break;
                        }
                    }

                    if (!toDelete.empty())
                    {
                        for (auto kt : toDelete)
                        {
                            perms.erase(kt);
                        }
                    }
                    
                }

                baseVal.second += dist;
            }
            else
            {
                perms.insert({ 0, 0 });
            }

            baseVal.first += elem;

            dist = 0;
        }
    }

    //cout << "A" << baseVal.first << ":" <<  << endl;

    long long koszt = (*perms.lower_bound({ -baseVal.first, LLONG_MIN })).second;
    cout << koszt + baseVal.second << endl;

}