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
#include "kanapka.h"
#include "message.h"
#include <algorithm>
#include <iostream>
#include <limits.h>
using namespace std;

int main() {
int nn=NumberOfNodes();
long long N = GetN(),i,j,k,l,r,m=0;
long long h=(N+1)/nn;
if(h==0)h+=1;

if (MyNodeId()==0)
{
//cerr << nn<<endl;
//cerr << N<<endl;
//cerr << h<<endl;
}

l=0;
for (i=MyNodeId()*h;(i<=((((MyNodeId()+1)*h>N)||(MyNodeId()==nn-1))?N:((MyNodeId()+1)*h-1)));++i)
{
r=0;

if (i>0)l+=GetTaste(i-1);
//cerr << "l===="<<l<<endl;
for (j=0;(j<=N) && (i+j<=N);++j)
{
if (j>0)r+=GetTaste(N-j);
if (l+r>m)m=l+r;
//cerr <<MyNodeId()<<":"<< i<<"---"<<j<<" "<<l<<" "<<r<<endl;
}
}
//cerr <<MyNodeId()<<": l="<< l<<" m="<<m<<endl;
PutLL(0,l);
PutLL(0,m);
Send(0);
if (MyNodeId()==0)
{
long long fm=0;
for(int p=0;p<nn;p++)
{
Receive(p);
long long ml=GetLL(p);
long long mm=GetLL(p);
//cerr << "R"<<p<<":"<<mm<<":"<<ml<<endl;
if (mm+fm>m)m=mm+fm;
fm+=ml;
if (fm>m)m=fm;
}
cout << m<<endl;
}
  return 0;
}