CF762D.Maximum path

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

You are given a rectangular table $3×n$ . Each cell contains an integer. You can move from one cell to another if they share a side.

Find such path from the upper left cell to the bottom right cell of the table that doesn't visit any of the cells twice, and the sum of numbers written in the cells of this path is maximum possible.

输入格式

The first line contains an integer $n$ ( $1<=n<=10^{5}$ ) — the number of columns in the table.

Next three lines contain $n$ integers each — the description of the table. The $j$ -th number in the $i$ -th line corresponds to the cell $a_{ij}$ ( $-10^{9}<=a_{ij}<=10^{9}$ ) of the table.

输出格式

Output the maximum sum of numbers on a path from the upper left cell to the bottom right cell of the table, that doesn't visit any of the cells twice.

输入输出样例

输入#1
```
3
1 1 1
1 -1 1
1 1 1
```
输出#1
```
7
```

输入#2

5
10 10 10 -1 -1
-1 10 10 10 10
-1 10 10 10 10

输出#2

说明/提示

The path for the first example:

The path for the second example:

首页