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

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
const int N = 1e6;
const LL INF = 1e18;

int main()
{
    int n = (int)GetN();
    int nNodes = NumberOfNodes();
    int id = MyNodeId();

    int siz = (int)(n/nNodes) + 1;
    int a = id*siz;
    int b = min(n-1,a+siz - 1); 
    LL sum = 0, maxS = 0, min1 = INF, min2 = INF;

    for(int i = a;i <= b;++i)
    {
        sum += GetTaste(i);
        maxS = max(maxS, sum);
        min1 = min(min1, sum);
        min2 = min(min2, sum-maxS);
    }

    if(id > 0)
    {
        PutLL(0, min1);
        PutLL(0, min2);
        PutLL(0, maxS);
        PutLL(0, sum);
        Send(0);
    }
    else
    {
        LL minS = min2;

        for(int i = 1;i < nNodes;++i)
        {
            Receive(i);
            min1 = GetLL(i);
            min2 = GetLL(i);
            min1 -= maxS - sum;
            minS = min(min2, minS);
            minS = min(min1, minS);
            maxS = max(maxS, sum + GetLL(i));
            sum += GetLL(i);
        }
        cout << sum - minS << endl;
    }

    return 0;
}