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
// Artur Kraska, II UWr

#include "kanapka.h"
#include "message.h"

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <cmath>
#include <list>
#include <set>
#include <map>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(typeof(coll.begin()) iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(typeof(coll.rbegin()) iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,R,PRED)            ({typeof(P) X=P,RRR=(R), PPP = P; while(PPP<RRR) {X = (PPP+(RRR-PPP)/2); if(PRED) RRR = X; else PPP = X+1;} PPP;})
#define testy()                     int _tests; scanf("%d", &_tests); FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define deb(X)                      X;

#define M 1000000007
#define INF 1000000007

using namespace std;

struct elem
{
    long long l, p, maks, suma;
};
elem e, tab[1007], e2;

int main()
{
    int ILE =  NumberOfNodes();
    int NR = MyNodeId();

    long long n = GetN();

    long long pocz = n*NR/ILE, kon = n*(NR+1)/ILE-1;

    FOR(i, pocz, kon)
    {
        long long a = GetTaste(i);
        e.suma += a;
        e.l = min(e.l, e.suma);
        e.p = min(e.p+a, 0ll);
        e.maks = min(e.maks, e.p);
    }

//    cout << "watek " << NR << ", maks: " << e.maks << ", suma: " << e.suma << endl;


    if(NR == 0)
    {
        FOR(i, 1, ILE-1)
        {
            Receive(i);
            e2.suma = GetLL(i);
            e2.l = GetLL(i);
            e2.p = GetLL(i);
            e2.maks = GetLL(i);

            e.maks = min(min(e.maks, e2.maks), e.p+e2.l);
            e.l = min(e.l, e.suma+e2.l);
            e.p = min(e2.p, e2.suma+e.p);
            e.suma = e.suma + e2.suma;
        }
        printf("%lld\n", e.suma - e.maks);
    }
    else
    {
        PutLL(0, e.suma);
        PutLL(0, e.l);
        PutLL(0, e.p);
        PutLL(0, e.maks);
        Send(0);
    }

    return 0;
}