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

#include <algorithm>
#include <iostream>

using namespace std;

long long mx[2];

int main() {
  int N  = GetN();
  //cin >> N;
  long long sum = 0;
  int idx = 0;
  for(int i = 0; i < N; ++i) {
    int t;
    //cout << "GetTaste(" << i << ") " << endl;
    //cin >> t;
    sum += GetTaste(i);
    if(sum > mx[0]) {
      mx[0] = sum;
      idx = i;
    }
  }
  sum = 0;
  for(int i = N - 1; i >= 0; --i) {
    int t;
    //cout << "GetTaste(" << i <<")" << endl;
    //cin >> t;
    sum += GetTaste(i);
    if(sum > mx[1] && i > idx) {
      mx[1] = sum;
    }
  }
  if(MyNodeId() == 0) {
    cout << mx[0] + mx[1] << endl;
  }

  return 0;
}