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
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
#include <algorithm>
#include "kanapka.h"
#include "message.h"

using namespace std;

int main()
{
	long long int n, linst, part, x, mpref, msuf, msi;
	n=GetN();
	linst=NumberOfNodes();
	part=n%linst==0?n/linst:n/linst+1;
	
	vector <long long int> pref;
	vector <long long int> suf;
	pref.push_back(0);
	
	for(long long int i=MyNodeId()*part;i<min(n, (MyNodeId()+1)*part);i++)
	{
	 x=GetTaste(i);
	 pref.push_back(pref.back()+x);
	}
	
	suf.push_back(pref.back());
	
	for(int i=1;i<pref.size();i++)
		suf.push_back(suf.front()-pref[i]);
	
	mpref=0;
	msuf=suf.front();
	msi=-1;
	
	for(int i=0;i<pref.size();i++)
		if(i>=msi || pref[i]>mpref)
			for(int j=i;j<suf.size();j++)
				if(pref[i]+suf[j]>mpref+msuf)
				{
				 mpref=pref[i];
				 msuf=suf[j];
				 msi=j;
				}
				
	if(MyNodeId()>0)
	{
	 PutLL(0, mpref);
	 PutLL(0, msuf);
	 PutLL(0, pref.back());
	 Send(0);
	}
	else
	{
	 long long int mprefall[linst], msufall[linst], sumall[linst], sump, sums, wyn;
	 mprefall[0]=mpref;
	 msufall[0]=msuf;
	 sumall[0]=pref.back();
	 
		for(int i=1;i<linst;i++)
		{
		 Receive(i);
		 mprefall[i]=GetLL(i);
		 msufall[i]=GetLL(i);
		 sumall[i]=GetLL(i);
		}
		
		sump=0;
		
		for(int i=0;i<linst;i++)
		{
		 mprefall[i]=mprefall[i]+sump;
		 sump=sump+sumall[i];
		}
		
		sums=0;
		
		for(int i=linst-1;i>=0;i--)
		{
		 msufall[i]=msufall[i]+sums;
		 sums=sums+sumall[i];
		}
		
		wyn=0;
			
		for(int i=0;i<linst;i++)
			for(int j=i;j<linst;j++)
				wyn=max(wyn, mprefall[i]+msufall[j]);
			
	 printf("%lld\n", wyn);
	}
	
	return 0;
}