zoukankan      html  css  js  c++  java
  • cf 1016C

    C. Vasya And The Mushrooms
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard 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·105) — the length of the glade.

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

    The third line contains n numbers b1, b2, ..., bn (1 ≤ bi ≤ 106) 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
    Copy
    3
    1 2 3
    6 5 4
    output
    Copy
    70
    input
    Copy
    3
    1 1000 10000
    10 100 100000
    output
    Copy
    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.
     
     
     
     1 #include<cstdio>
     2 #include<algorithm>
     3 #include<cstring>
     4 #include<cmath>
     5 #include<iostream>
     6 #include<vector>
     7 using namespace std;
     8 typedef long long ll;
     9 int n;
    10 #define N 300009
    11 #define ll long long 
    12 ll a[2][N],sum[2][N],s[N];
    13 /*
    14 sum[0][i]:从a[0][i]走到a[1][i]的花费,a[0][i]为起点,a[1][i]为终点
    15 sum[0][i]:从a[1][i]走到a[0][i]的花费,a[1][i]为起点,a[0][i]为终点
    16 s[i] : 前i列的两行数据之和
    17 */
    18 int main()
    19 {
    20     scanf("%d",&n);
    21     for(int i=1;i<=n;i++) scanf("%lld",&a[0][i]);
    22     for(int i=1;i<=n;i++) scanf("%lld",&a[1][i]);
    23     for(int i=1;i<=n;i++) s[i]=s[i-1]+a[0][i]+a[1][i];
    24     sum[0][n]=a[1][n];sum[1][n]=a[0][n];
    25     for(int i=n-1;i>=1;i--){
    26         sum[0][i]=sum[0][i+1]+s[n]-s[i]+a[1][i]*(1+2*(n-i));
    27         /*
    28         s[n]-s[i]+a[1][i]*(1+2*(n-i)):sum[0][i]与sum[1][i]的差值
    29         */
    30         sum[1][i]=sum[1][i+1]+s[n]-s[i]+a[0][i]*(1+2*(n-i));
    31     }
    32     ll ans=sum[0][1];
    33     ll cnt=0;
    34     //只能前面若干个锯齿行走,在U 行走
    35     for(int i=1;i<=n;i++){
    36         if(i&1){
    37             cnt+=a[0][i]*(2*i-2)+a[1][i]*(2*i-1);//锯齿花费
    38             ans=max(ans,cnt+sum[1][i+1]+(s[n]-s[i])*(2*i));
    39             //(s[n]-s[i])*(2*i)  :sum[1][i+1]的起点为i+1,但实际不是
    40         }
    41         else{
    42             cnt+=a[0][i]*(2*i-1)+a[1][i]*(2*i-2);
    43             ans=max(ans,cnt+sum[0][i+1]+(s[n]-s[i])*(2*i));
    44         }
    45     }
    46     printf("%lld
    ",ans);
    47     return 0;
    48 }
  • 相关阅读:
    Django安装和启动
    转载:Python 包管理工具解惑
    电子商务的基本理念
    javascript的循环使用
    错误码
    weex初始
    Flex 布局
    css样式重置表
    手机端页面自适应解决方案—rem布局
    实用的60个CSS代码片段[下]
  • 原文地址:https://www.cnblogs.com/tingtin/p/9435184.html
Copyright © 2011-2022 走看看