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
#include <cstdio>
#include <cmath>

#include "message.h"
#include "kanapka.h"

int main()
{
	long long n = GetN();
	

	// do all calculations on one instance
	if (n <= 500000000)
	{
		long long maxLeft = 0, sumLeft = 0, endLeft = 0;
		long long maxRight = 0, sumRight = 0, endRight = n-1;

		if (MyNodeId() == 0)
		{
			for (int i = 0; i <= n/2; ++i)
			{
				sumLeft += GetTaste(i);

				if (sumLeft > maxLeft)
					maxLeft = sumLeft;

				if (sumLeft < 0)
				{
					endLeft = i;
				}
			}

			for (int i = n-1; i >= n/2; --i)
			{
				sumRight += GetTaste(i);

				if (sumRight > maxRight)
					maxRight = sumRight;

				if (sumRight < 0 || i-1 == endLeft)
				{
					endRight = i;
				}
			}

			printf("%lld\n", maxLeft + maxRight);
		}
	}
	else
	{

	long long partLength = std::floor(n/NumberOfNodes());
	long long leftOver = n - ((NumberOfNodes()-1)*partLength);

	int partsOnLeft = std::ceil((double)(NumberOfNodes()-1)/2);
	int partsOnRight = std::floor((double)(NumberOfNodes()-1)/2);

	long long max = 0, sum = 0;

	long long max2 = 0, sum2 = 0;

	char wholePartEaten = 0;

	if (MyNodeId() == NumberOfNodes()-1)
	{
		for (int i = partsOnLeft * partLength; i < partsOnLeft * partLength + leftOver; ++i)
		{
			sum += GetTaste(i);

			if (sum > max)
				max = sum;

			if (sum < 0)
				break;

			if (i+1 >= partsOnLeft * partLength + leftOver)
				wholePartEaten = 1;
		}

		/*for (int i = partsOnLeft * partLength + leftOver; i > partsOnLeft * partLength; --i)
		{
			sum2 += GetTaste(i);

			if (sum2 > max2)
				max2 = sum2;

			if (sum2 < 0)
				break;

			if (i-1 <= partsOnLeft * partLength)
				wholePartEaten = 1;
		}*/
	}
	else if (MyNodeId() % 2 == 0)
	{
		for (int i = MyNodeId()/2 * partLength; i < MyNodeId()/2 * partLength + partLength; ++i)
		{
			sum += GetTaste(i);

			if (sum > max)
				max = sum;

			if (sum < 0)
				break;

			if (i+1 >= MyNodeId()/2 * partLength + partLength)
				wholePartEaten = 1;
		}
	}
	else
	{
		for (int i = n - (std::floor(MyNodeId()/2) * partLength); 
			 i > n - (std::floor(MyNodeId()/2) * partLength) + partLength; --i)
		{
			sum += GetTaste(i);

			if (sum > max)
				max = sum;

			if (sum < 0)
				break;

			if (i-1 <= n - (std::floor(MyNodeId()/2 * partLength) + partLength))
				wholePartEaten = 1;
		}
	}

	if (MyNodeId() > 0)
	{
		PutLL(0, max);
		PutChar(0, wholePartEaten);
		Send(0);
	}
	else
	{

	}

	}
}