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
#include "kanapka.h"
#include "message.h"
#include <iostream>
#include <istream>
#include <fstream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <set>
#include <map>
#include <cmath>

using namespace std;
long long Nvalues;

/*
long long GetTaste(long long nr)
{
	vector<long long> vec = { 10, -2, 5, -4, 3, -5, 1 };
	return vec[nr];
}

long long GetN()
{
	return 7;
}

int MyNodeId()
{
	return 0;
}*/

long long calcLeft(long long k)
{
	long long sum = 0;
	for (long long i = 0; i <= k; i++)
	{
		sum += GetTaste(i);
	}
	return sum;
}

long long calcRight(long long k)
{
	long long sum = 0;
	for (long long i = Nvalues - 1; i >= k; i--)
	{
		sum += GetTaste(i);
	}
	return sum;
}

int main()
{
	Nvalues = GetN();
	int currId = MyNodeId();
	if (currId == 0)
	{
		long long maxSum = 0;
		for (long long i = -1; i < Nvalues; i++)
		{
			long long s1 = calcLeft(i);
			maxSum = max(maxSum, s1);

			for (long long j = i + 1; j <= Nvalues; j++)
			{
				long long s2 = calcRight(j);
				maxSum = max(maxSum, s2);

				long long s = s1 + s2;
				maxSum = max(maxSum, s);
			}
		}
		cout << maxSum << endl;
	}
	else
	{
	}

	return 0;
}