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
#include "maklib.h"
#include "message.h"

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <stack>
#include <bitset>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
typedef short int sint;
#define FOR(x, b, e) for(int x=(b); x<=(e); ++x)
#define FORD(x, b, e) for(int x=((int)(b))-1; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v,n) typeof(n) v=(n)
#define ALL(c) c.begin(),c.end()
#define SIZE(x) ((int)((x).size()))
#define FOREACH(i,c) for(VAR(i,(c).begin());i!=(c).end();++i)
#define PB push_back
#define ST first
#define ND second
#define mp(x,y) make_pair(x,y)
#define DEBUG 1
#define debug(x) {if (DEBUG)cerr <<#x <<" = " <<x <<endl; }
#define debugv(x) {if (DEBUG) {cerr <<#x <<" = "; FOREACH(it, (x)) cerr <<*it <<", "; cout <<endl; }}
#define REMAX(a,b) (a)=max((a),(b));
#define REMIN(a,b) (a)=min((a),(b));
#define wez(n) int (n); scanf("%d",&(n));
#define wez2(n,m) int (n),(m); scanf("%d %d",&(n),&(m));

struct Elem {
	ll pref, suff, all, best;
};

Elem lacz(const Elem& left, const Elem& right) {
	Elem res;
	res.pref = max(left.pref, left.all + right.pref);
	res.suff = max(right.suff, left.suff + right.all);
	res.all = left.all + right.all;
	res.best = max(left.suff + right.suff, max(left.best, right.best));
	return res;
}

Elem curr;

int main() {
	int nodeCount = NumberOfNodes();

	// Phase 1
	int myId = MyNodeId();
	int rozm = Size();
	int dl = (rozm + nodeCount - 1) / nodeCount;
	int pocz = dl * myId, kon = min(dl * (myId + 1), rozm);
	ll currBest = 0;
	FOR(i, pocz, kon - 1) {
		ll currElem = ElementAt(i + 1);
		curr.all += currElem;
		currBest += currElem;
		if (curr.all > curr.pref) curr.pref = curr.all;
		if (currBest > curr.best) curr.best = currBest;
		if (currBest < 0) currBest = 0;
	}
	curr.suff = currBest;

	if (myId == 0) {
		FOR(i, 1, nodeCount - 1) {
			Elem temp;
			Receive(i);
			temp.pref = GetLL(i);
			temp.suff = GetLL(i);
			temp.all = GetLL(i);
			temp.best = GetLL(i);
			curr = lacz(curr, temp);
		}
		cout << curr.best << endl;
	} else {
		PutLL(0, curr.pref);
		PutLL(0, curr.suff);
		PutLL(0, curr.all);
		PutLL(0, curr.best);
		Send(0);
	}

	return 0;
}