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
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <sstream>
#include <vector>
#include <list>
#include <set>
#include <map>
#include "message.h"
#include "kanapka.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 int INF = 1000000001;
const double EPS = 10e-9;

LL n;

struct Taste
{
	LL allTaste = 0;
  	LL leastTaste = 0;
  	LL prefixTaste = 0;
  	LL sufixTaste = 0;

  	void compute()
  	{
  		LL begin = (MyNodeId() * n) / NumberOfNodes();
	  	LL end = ((MyNodeId() + 1) * n) / NumberOfNodes();

	  	LL mostTaste = 0;
	  	LL minusTaste = 0;
	  	for (LL i = begin; i < end; ++i)
	  	{
	  		LL taste = GetTaste(i);

	  		allTaste += taste;

	  		minusTaste += taste;
	  		minusTaste = min(0LL, minusTaste);
	  		leastTaste = min(leastTaste, minusTaste);

	  		prefixTaste = min(prefixTaste, allTaste);
	  		mostTaste = max(mostTaste, allTaste);
	  	}
	  	sufixTaste = allTaste - mostTaste;

	  	// printf("[%lld %lld]: all = %lld, least = %lld, prefix = %lld, sufix = %lld\n", begin, end - 1, allTaste, leastTaste, prefixTaste, sufixTaste);
  	}

  	void sendTaste()
  	{
  		PutLL(0, allTaste);
  		PutLL(0, leastTaste);
  		PutLL(0, prefixTaste);
  		PutLL(0, sufixTaste);
  		Send(0);
  	}

  	void receiveTaste(int instance)
  	{
  		Receive(instance);
  		allTaste = GetLL(instance);
  		leastTaste = GetLL(instance);
  		prefixTaste = GetLL(instance);
  		sufixTaste = GetLL(instance);
  	}
};

bool shouldCompute(int instance)
{
	LL begin = (instance * n) / NumberOfNodes();
	LL end = ((instance + 1) * n) / NumberOfNodes();
	// printf("%lld %lld\n", begin, end - 1);
	return end > begin;
}

LL putTastesTogether(vector<Taste>& tastes)
{
	LL result = 0;
	LL tasteSum = 0;
	for (auto it : tastes)
	{
		tasteSum += it.allTaste;
		result = min(result, it.leastTaste);
	}

	int count = tastes.size();
	for (int i = 0; i < count - 1; ++i)
	{
		LL taste = tastes[i].sufixTaste + tastes[i + 1].prefixTaste;
		result = min(result, taste);
		for (int j = i + 2; j < count; ++j)
		{
			taste -= tastes[j - 1].prefixTaste;
			taste += tastes[j - 1].allTaste;
			taste += tastes[j].prefixTaste;

			result = min(result, taste);
		}
	}

	return tasteSum - result;
}

int main()
{
	n = GetN();
	bool should = shouldCompute(MyNodeId());
	Taste taste;
	if (should)
	{
		taste.compute();
	}

	if (should && MyNodeId() != 0)
	{
		taste.sendTaste();
	}
	else if (MyNodeId() == 0)
	{
		vector<Taste> tastes;
		tastes.reserve(NumberOfNodes());
		if (should)
		{
			tastes.push_back(taste);
		}
		for (int i = 1; i < NumberOfNodes(); ++i)
		{
			if (shouldCompute(i))
			{
				Taste it;
				it.receiveTaste(i);
				tastes.push_back(it);
			}
		}

		LL result = putTastesTogether(tastes);

		printf("%lld\n", result);
	}

	return 0;
}