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
///makra zaczerpniete z "Algorytmiki Praktycznej" Piotra Stanczyka
#include "kanapka.h"
#include "message.h"
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
//#include <complex>
//#include <iterator>
#include <set>
//#include <bitset>
#include <map>
//#include <stack>
#include <list>
//#include <queue>
//#include <deque>
using namespace std;
typedef vector<int> VI;
typedef long long LL;
#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 ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i !=(c).end(); ++i)
#define FORE(i, c) for(VAR(i, (c).begin()), KS=(c).end(); i !=KS; ++i)
#define PB push_back
#define ST first
#define ND second
const int INF = 1000000001;
const double EPS = 10e-9;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<double> VD;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
#define PF push_front
#define MP make_pair
LL max3(LL a,LL b, LL c)
{
  if(a<b)
    a=b;
  if(a>c)
    return a;
  return c;
}
struct czt
{
  LL l,p,d,c;
  czt(LL x=0,LL y=0,LL z=0,LL t=0)
  {
    l=x;
    p=y;
    d=z;
    c=t;
  }
  void pr(czt x)
  {
    d=max3(d+x.c,c+x.d,l+x.p);
    p=max(x.p,x.c+p);
    l=max(l,c+x.l);
    c+=x.c;
  }
};
int main()
{
  const int mni=MyNodeId(),non=NumberOfNodes();
  const LL n=GetN(),bg=n*mni/non,en=n*(mni+1)/non;
  LL i,s;
  czt w,p;
  for(i=bg;i<en;++i)
  {
    s=GetTaste(i);
    if(s>0)
      w.pr(czt(s,s,s,s));
    else
      w.pr(czt(0,0,0,s));
  }
  if(mni!=non-1)
  {
    Receive(mni+1);
    p.l=GetLL(mni+1);
    p.p=GetLL(mni+1);
    p.d=GetLL(mni+1);
    p.c=GetLL(mni+1);
    w.pr(p);
  }
  if(mni)
  {
    PutLL(mni-1,w.l);
    PutLL(mni-1,w.p);
    PutLL(mni-1,w.d);
    PutLL(mni-1,w.c);
    Send(mni-1);
  }
  else
    printf("%lld",w.d);
  return 0;
}