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
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <sstream>
#include <vector>
#include <list>
#include <map>
#include "maklib.h"
#include "message.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef pair<int, int> PI;
typedef vector<PI> VPI;
typedef long long LL;
typedef vector<LL> VLL;
#define FOR(x, b, e) for(int x = b; x <= (e); ++x)
#define FORD(x, b, e) for(int x = b; x >= (e); --x)
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define PB push_back
#define MP make_pair
#define ST first
#define ND second
const LL INF = 1000000000000000001l;
const double EPS = 10e-9;

int main()
{
    int n;
    LL p, q, suma, mini, maxi, result, prev, w;
    n = Size();
    p = (MyNodeId() * n) / NumberOfNodes() + 1;
    q = ((MyNodeId() + 1) * n) / NumberOfNodes();
    if(q < p)
    {
        mini = -INF;
        maxi = -INF;
        suma = -INF;
        result = -INF;
    }
    else
    {
        suma = mini = 0;
        maxi = result = -INF;
        FOR(i, p, q)
        {
            suma += ElementAt(i);
            mini = min(mini, suma);
            maxi = max(maxi, suma);
            result = max(result, suma - mini);
        }
    }
    if(MyNodeId() != 0)
    {
        PutLL(0, result);
        PutLL(0, maxi);
        PutLL(0, mini);
        PutLL(0, suma);
        Send(0);
    }
    else
    {
        w = -INF;
        prev = 0;
        if(result != INF)
        {
            w = max(w, result);
            prev = suma - mini;
        }
        FOR(i, 1, NumberOfNodes() - 1)
        {
            Receive(i);
            result = GetLL(i);
            maxi = GetLL(i);
            mini = GetLL(i);
            suma = GetLL(i);
            if(result != -INF)
            {
                w = max(w, result);
                w = max(w, prev + maxi);
                prev = max(prev + suma, suma - mini);
            }
        }
        printf("%lld\n", w);

    }
    return 0;
}