cf Educational Codeforces Round 48 C. Vasya And The Mushrooms

原题：

C. Vasya And The Mushrooms
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Vasya’s house is situated in a forest, and there is a mushroom glade near it. The glade consists of two rows, each of which can be divided into n consecutive cells. For each cell Vasya knows how fast the mushrooms grow in this cell (more formally, how many grams of mushrooms grow in this cell each minute). Vasya spends exactly one minute to move to some adjacent cell. Vasya cannot leave the glade. Two cells are considered adjacent if they share a common side. When Vasya enters some cell, he instantly collects all the mushrooms growing there.

Vasya begins his journey in the left upper cell. Every minute Vasya must move to some adjacent cell, he cannot wait for the mushrooms to grow. He wants to visit all the cells exactly once and maximize the total weight of the collected mushrooms. Initially, all mushrooms have a weight of 0. Note that Vasya doesn’t need to return to the starting cell.

Help Vasya! Calculate the maximum total weight of mushrooms he can collect.

Input
The first line contains the number n (1 ≤ n ≤ 3·10^5) — the length of the glade.

The second line contains n numbers a1, a2, …, an (1 ≤ ai ≤ 10^6) — the growth rate of mushrooms in the first row of the glade.

The third line contains n numbers b1, b2, …, bn (1 ≤ bi ≤ 10^6) is the growth rate of mushrooms in the second row of the glade.

Output
Output one number — the maximum total weight of mushrooms that Vasya can collect by choosing the optimal route. Pay attention that Vasya must visit every cell of the glade exactly once.

Examples
input
3
1 2 3
6 5 4
output
70
inputCopy
3
1 1000 10000
10 100 100000
output
543210

Note
In the first test case, the optimal route is as follows:

Thus, the collected weight of mushrooms will be 0·1 + 1·2 + 2·3 + 3·4 + 4·5 + 5·6 = 70.
In the second test case, the optimal route is as follows:

Thus, the collected weight of mushrooms will be 0·1 + 1·10 + 2·100 + 3·1000 + 4·10000 + 5·100000 = 543210.

中文：

给你一个2×n大小的格子图，每个格子上都有蘑菇，每个格子的都有一个数字表示蘑菇每个单位时间的生长速度，现在让你从左上角出发，美走一个格子画1个单位时间，每个格子都要走过，而且不能走回头路，为你最多能摘多少个蘑菇？

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn=300002;

ll n;
ll a[maxn],b[maxn];

ll sum1[maxn],sum2[maxn],bsum[maxn],pre[maxn*2];
ll test[maxn];

int fun1(int s)//测试，从第一排出发走直线
{
    int tot=0;
    int j=s;
    for(int i=(s+1)/2;i<=n;i++,j++)
    {
        tot+=a[i]*(j-1);
    }
    cout<<endl;
    for(int i=n;i>=(s+1)/2;i--,j++)
    {
        tot+=b[i]*(j-1);
    }
    return tot;
}
int fun2(int s)//测试，从第二排出发走直线
{
    int tot=0;
    int j=s;
    for(int i=(s+1)/2;i<=n;i++,j++)
    {
        tot+=b[i]*(j-1);
    }
    cout<<endl;
    for(int i=n;i>=(s+1)/2;i--,j++)
    {
        tot+=a[i]*(j-1);
    }
    return tot;
}
int main()
{
    ios::sync_with_stdio(false);
    while(cin>>n)
    {
        memset(sum1,0,sizeof(sum1));
        memset(sum2,0,sizeof(sum2));
        memset(bsum,0,sizeof(bsum));
        memset(pre,0,sizeof(pre));

        for(int i=1;i<=n;i++)
            cin>>a[i];
        for(int i=1;i<=n;i++)
            cin>>b[i];

        bsum[n]=(a[n]+b[n]);

        for(int i=n-1;i>=1;i--)
            bsum[i]=bsum[i+1]+(a[i]+b[i]);

        for(ll i=1;i<=n*2;i+=4)
        {
            pre[i]=pre[i-1]+a[(i+1)/2]*(i-1);
            pre[i+1]=pre[i]+b[(i+1)/2]*i;
            pre[i+2]=pre[i+1]+b[(i+1)/2+1]*(i+1);
            pre[i+3]=pre[i+2]+a[(i+1)/2+1]*(i+2);
        }

        ll ans=0,tmp=0;

        for(ll i=n;i>=1;i--)
        {
            sum1[i]=sum1[i+1]+a[i]*(i-1)+b[i]*(2*n-i);
            sum2[i]=sum2[i+1]+a[i]*(2*n-i)+b[i]*(i-1);
        }


        for(ll i=1;i<=2*n;i+=4)
        {
            tmp=pre[i-1]+sum1[(i+1)/2]+bsum[(i+1)/2]*((i+1)/2-1);
            ans=max(ans,tmp);
        }
        for(ll i=3;i<=2*n;i+=4)
        {
            tmp=pre[i-1]+sum2[(i+1)/2]+bsum[(i+1)/2]*((i+1)/2-1);

            ans=max(ans,tmp);
        }
        cout<<ans<<endl;
    }
    return 0;
}

解答：

在纸上画一画就能知道这道题的行动规律，要想一个不漏，而且不重复的走过所有的格子，只有两种走法，一种是走“蛇形”，另一种是走到头，然后再拐到另一行走回来。

如图，蛇形走法

如图，走到头再拐到另一行

那么要想得到最优的路线，那么一定是这两种走法的组合

如图

由数据可以知道，时间复杂度必须控制在O(nlogn)之内

所以需要对格子里的数据进行预处理，这里使用pre[i]记录走了前i步的红色路径（蛇形）的和(i<=2×n)

红色路径的好处理，关键是蓝色路径如何预处理出累加和，使得可以在枚举每一列的时候，通过使用红色路径的结果加上蓝色路径的结果就能得到当前组合的答案。

假设前面的红色路径走到了第二列第一排，后面路径采用蓝色走法，那么格子中的权重如下

如果红色路径走到了第一排第四列，格子的权重如下

注意两个图的蓝色路径的权值！对比最后三列，对应行和列上面的数字都相差2！

蓝色路径的权值对比单独拿出来，9-7=2，10-8=2…14-12=2

5  6  7  8  9
14 13 12 11 10
      9  10 11
      14 13 12   

那么，可以用累加数组sum1[i]，从后向前记录走到第一排第i列时蓝色路径的累加和
同时使用bsum[i]从后向前，记录后i列两行值相加的累加和。

这样，在枚举第i列时，判断前i列使用红色路径，后面n-i列使用蓝色路径就可以使用公式
$pre[i-1]+sum1[(i+1)/2]+bsum[(i+1)/2]*((i+1)/2-1)$ 这里i是从1到2×n的

同理使用sum2保存第二排出发的蓝色路径，最后更新最大值即可