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

int inst;
int no;

long long Sum, MaxPref, MaxSuf, MaxSandwich;

int main()
{
	ios_base::sync_with_stdio(false);
	
	no = NumberOfNodes();
	inst = MyNodeId();
	
	int N, l, r, part;
	
	N = GetN();
	part = N/no;
	l = part * inst;
	if( inst == no-1 )
		r = N - 1;
	else
		r = part * (inst+1) - 1;
		
	
	
	long long * kan = new long long [r-l+1];
	for( int i=l ; i<=r ; i++ )
		kan[i-l] = GetTaste(i);
	
	Sum = MaxPref = MaxSuf = MaxSandwich = 0;
	
	long long *suf = new long long [r-l+2];
	suf[r-l+1] = 0;
	long long s = 0, b = 0;
	for( int i=r ; i>=l ; i-- ) {
		s = s + kan[i-l];
		if( b < s )
			b = s;
		suf[i-l] = b;
	}
	Sum = s;
	MaxSuf = b;
	
	
	long long p = 0, t = 0;
	for( int i=l ; i<=r ; i++ ) {
		t += kan[i-l];
		
		if( MaxSandwich < p + suf[i-l+1] )
			MaxSandwich = p + suf[i-l+1];				
		
		if( p<t )
			p = t;
	}
	MaxPref = p;
	if( MaxSandwich < Sum )
		MaxSandwich = Sum;
		
	if( inst>0 ) {
		PutLL(0, Sum);
		PutLL(0, MaxPref);
		PutLL(0, MaxSuf);
		PutLL(0, MaxSandwich);
		Send(0);
	}
	else {
		long long *Sum, *MaxPref, *MaxSuf, *MaxSandwich;
		
		Sum = new long long [no];
		MaxPref = new long long [no];
		MaxSuf = new long long [no];
		MaxSandwich = new long long [no];
		
		Sum[0] = ::Sum;
		MaxPref[0] = ::MaxPref;
		MaxSuf[0] = ::MaxSuf;
		MaxSandwich[0] = ::MaxSandwich;
		
		for( int i=1 ; i<no ; i++ ) {
			Receive(i);
			Sum[i] = GetLL(i);
			MaxPref[i] = GetLL(i);
			MaxSuf[i] = GetLL(i);
			MaxSandwich[i] = GetLL(i);
		}
		
		
		long long result = 0;
		long long total = 0;
		for( int i=0 ; i<no ; i++ )
			total += Sum[i];
		if( result<total )
			result = total;
		
		for( int i=0 ; i<no ; i++ )
			if( result < total - Sum[i] + MaxSandwich[i] )
				result = total - Sum[i] + MaxSandwich[i];
		
		long long *suf = new long long [no+1];
		suf[no] = 0;
		long long c = 0;
		for( int i=no-1 ; i>=0 ; i++ ) {
			if( suf[i+1] < c + MaxSuf[i] )
				suf[i] = c + MaxSuf[i];
			else
				suf[i] = suf[i+1];
			c += Sum[i];
		}
		
		long long p=0;
		for( int i=0 ; i<no ; i++ ) {
			if( result < p + suf[i+1] )
				result = p + suf[i+1];
			p += Sum[i];
		}
		
		cout << result << endl;
		return 0;
		
	}
	
	
	
	
	
	return 0;
}