Codeforces 762D. Maximum path 题目详解+错点记录

Codeforces 762D. Maximum path

---

首先，这是一道DP题，虽然说有简便的做法，但我还是采用了插头DP的方法（不知道是不是插头DP，可能是轮廓线DP）

Problem

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.

Input

The first line contains an integer n (1 ≤ n ≤ 105) — 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 aij ( - 109 ≤ aij ≤ 109) of the table.

Output

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.

Examples

Input

3
1 1 1
1 -1 1
1 1 1

Output

7

Input

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

Output

110

Note

The path for the first example:

The path for the second example:

好了，那么这道题其实就是要求不重复经过某个方格，求从左上角到右下角的路径上权值和最大值。注意本题方格中的权值可以为负

思路

我曾经参加过这次比赛，然而时间太短写不完。我知道本题应该有简便的DP方法，但我觉得正常的思路还是先使用插头DP（还是轮廓线DP）的方法。因为本题是一个窄棋盘（3*n）所以我们可以枚举一个竖列的所有情况，作为参数，进行状态转移

代码

不多说，贴代码（使用这种方法写的代码十分丑。。。）

#include<cstdio>
#include<cstdlib>
#define maxn 100005
#define maxn2 18