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

#include <algorithm>
#include <iostream>
using namespace std;

int main() {
  long long d = NumberOfNodes();
  long long id = MyNodeId();
  long long N = GetN();
  long long N2 = N / 2;
  long long len = N2 / d;
  long long s = id * len;
  long long e = min(N2+1, (id + 1) * len);
  long long maxleftsma = 0;
  long long maxrightsma = 0;
  long long curleftsma = 0;
  long long currightsma = 0;
  long long ml = 0;
  long long mr = 0;
  long long lefts[101];
  long long rights[101];
  long long leftind = -1;
  
  if (len == 0) {
	if (id == 0) {
		s = 0; e = N2+1;
	} else {
		s = 0; e = 0;
	}
  }

  for (long long i = s; i < e; ++i) {
	leftind = i;
	curleftsma += GetTaste(i);
 	if (curleftsma > maxleftsma) {
		maxleftind = i;
		maxleftsma = curleftsma;
	}
	currightsma += GetTaste(N - 1 - i);
	if (currightsma > maxrightsma)
		maxrightsma = currightsma;
  }
  if (leftind == N/2 + 1&& N % 2 == 1) {
	if (maxleftsma + GetTaste(N2+1) > maxleftsma)
		maxleftsma += GetTaste(N2+1);
  }
  if (id > 0) {
	PutLL(0, curleftsma);
	PutLL(0, currightsma);
	Send(0);
  } else {
	lefts[0] = maxleftsma;
	rights[0] = maxrightsma;
	for (int i = 1; i < d; ++i) {
      		int inst = Receive(-1);
      		long long l = GetLL(inst);
      		long long r = GetLL(inst);
		lefts[i] = l;
		rights[i] = r;
	}
	long long cl = 0;
	long long cr = 0;
	for (int i = 0; i < d; ++i) {
		cl += lefts[i];
		cr += rights[i];
		if (cl > ml)
			ml = cl;
		if (cr > mr)
			mr = cr;
	}		
  }

  if (id == 0) {
	cout << ml + mr << endl;
  }
  return 0;
}