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
#include "kanapka.h"
#include "message.h"

#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <cstdio>
#include <sstream>
#include <iostream>
#include <cstring>
#define REP(i,x,v)for(int i=x;i<=v;i++)
#define REPD(i,x,v)for(int i=x;i>=v;i--)
#define FOR(i,v)for(int i=0;i<v;i++)
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define pb push_back
#define sz size()
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define IN(x,y) ((y).find((x))!=(y).end())
#define LOLDBG
#ifdef LOLDBG
#define DBG(vari) cout<<#vari<<" = "<<vari<<endl;
#define DBG2(v1,v2) cout<<(v1)<<" - "<<(v2)<<endl;
#else
#define DBG(vari)
#define DBG2(v1,v2)
#endif
#define CZ(x) scanf("%d",&(x));
#define CZ2(x,y) scanf("%d%d",&(x),&(y));
#define ALL(x) (x).begin(),(x).end()
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
template<typename T,typename TT> ostream &operator<<(ostream &s,pair<T,TT> t) {return s<<"("<<t.first<<","<<t.second<<")";}
template<typename T> ostream &operator<<(ostream &s,vector<T> t){s<<"{";FOR(i,t.size())s<<t[i]<<(i==t.size()-1?"":",");return s<<"}"<<endl; }


int main()
{
    ll N = GetN();
    int my_id = MyNodeId();
    int n_nodes = NumberOfNodes();
    //PutInt(0, ile_dzielnikow);
    //Send(0);
    //Receive(instancja);
    //GetInt(instancja);
    ll L=my_id*N/n_nodes;
    ll R=(my_id+1)*N/n_nodes;

    ll sum = 0;
    ll mx = 0;
    ll mn = 0;
    ll res = 0;
    for (ll i=L;i<R;i++)
    {
        ll x = GetTaste(i);
        sum += x;
        mx = max(mx,sum);
        mn = min(mn,sum);
        res = min(res, sum-mx);
    }
    PutLL(0, sum);
    PutLL(0, mx);
    PutLL(0, mn);
    PutLL(0, res);
    Send(0);

    if (my_id == 0)
    {
        ll sum = 0;
        ll mx = 0;
        ll res = 0;
        FOR(j, n_nodes)
        {
            Receive(j);
            ll curr_sum = sum+GetLL(j);
            ll curr_mx = sum+GetLL(j);
            ll curr_mn = sum+GetLL(j);
            ll curr_res = GetLL(j);
            res = min(res,curr_res);
            res = min(res, curr_mn - mx);
            sum = curr_sum;
            mx = max(mx, curr_mx);
        }
        cout<<sum - res<<"\n";
    }
    return 0;
}