电梯问题——致敬ACM

刺骨的言语ヽ痛彻心扉 2022-01-06 07:39 310阅读 0赞

![v_src_360pic_strong_z_1_i_0_cmg_ecbca77f6133a7d9395628f81a44de8d_q_E5_9B_BE_E7_89_87_correct_E5_9B_BE_E7_89_87_cmsid_e3379f397e2187dd6df7166b363ca4dd_cmran_0_cmras_0_cn_0_gn_0_kn_45_multiple_0_gsrc_1_dataindex_8_id_78ca24e3a9af7ab373cfc716a65a1614_currsn_0_jdx_8_fsn_105_adsimgsn_0][]

***The Fair Nut and Elevator***

![1573326-20190120113724250-1786051546.jpg][]

*** ***

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

The Fair Nut lives in nn story house. aiai people live on the ii-th floor of the house. Every person uses elevator twice a day: to get from the floor where he/she lives to the ground (first) floor and to get from the first floor to the floor where he/she lives, when he/she comes back home in the evening.

It was decided that elevator, when it is not used, will stay on the xx-th floor, but xx hasn't been chosen yet. When a person needs to get from floor aa to floor bb, elevator follows the simple algorithm:

*  Moves from the xx-th floor (initially it stays on the xx-th floor) to the aa-th and takes the passenger.
 *  Moves from the aa-th floor to the bb-th floor and lets out the passenger (if aa equals bb, elevator just opens and closes the doors, but stillcomes to the floor from the xx-th floor).
 *  Moves from the bb-th floor back to the xx-th.

The elevator never transposes more than one person and always goes back to the floor xx before transposing a next passenger. The elevator spends one unit of electricity to move between neighboring floors. So moving from the aa-th floor to the bb-th floor requires |a−b||a−b|units of electricity.

Your task is to help Nut to find the minimum number of electricity units, that it would be enough for one day, by choosing an optimal the xx-th floor. Don't forget than elevator initially stays on the xx-th floor.

Input

The first line contains one integer nn (1≤n≤1001≤n≤100) — the number of floors.

The second line contains nn integers a1,a2,…,ana1,a2,…,an (0≤ai≤1000≤ai≤100) — the number of people on each floor.

Output

In a single line, print the answer to the problem — the minimum number of electricity units.

Examples

input

Copy

3
    0 2 1

output

Copy

input

Copy

2
    1 1

output

Copy

Note

In the first example, the answer can be achieved by choosing the second floor as the xx-th floor. Each person from the second floor (there are two of them) would spend 44 units of electricity per day (22 to get down and 22 to get up), and one person from the third would spend 88units of electricity per day (44 to get down and 44 to get up). 4⋅2\+8⋅1=164⋅2+8⋅1=16.

In the second example, the answer can be achieved by choosing the first floor as the xx-th floor.

题目来源：[http://codeforces.com/problemset/problem/1084/A][http_codeforces.com_problemset_problem_1084_A]

其实，这个题目只要理解清楚意思很好写。

题目大意是说：在一个n层的大楼里的住户每天要上下楼各一次，电梯每移动一层消耗一点电能，求：最少需要消耗的电能。

首先，要清楚题目中的第x层是一个未知的楼层。也就是说，需要找到最优的第x层得出最后的答案。有了这样的思路，题目就很好写了。

其次，注意题目本意是第x层需要返回。也就是说，每次执行上下楼层后都要返回第x层。

最后，话就不多说了，暴力可以解决的问题从来不是问题，如果是问题，那就是不够暴力。代码如下：

#include<stdio.h> #include<algorithm>
    using namespace std; int main() { int a[110];//存各楼层人数
        int n;//楼层数
        long long sum,ans=0x3f3f3f3f; scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d",&a[i]); } for(int i=1;i<=n;i++)//改变x的值
     { sum=0; for(int j=1;j<=n;j++) { sum+=(abs(j-i)+abs(i-1)+abs(j-1))*2*a[j];//各次上下楼层消耗电量的和
     } ans=min(sum,ans);//找出最优的答案
     } printf("%ld\n",ans); return 0; }

感觉好水。。。

转载于:https://www.cnblogs.com/noback-go/p/10294395.html

[v_src_360pic_strong_z_1_i_0_cmg_ecbca77f6133a7d9395628f81a44de8d_q_E5_9B_BE_E7_89_87_correct_E5_9B_BE_E7_89_87_cmsid_e3379f397e2187dd6df7166b363ca4dd_cmran_0_cmras_0_cn_0_gn_0_kn_45_multiple_0_gsrc_1_dataindex_8_id_78ca24e3a9af7ab373cfc716a65a1614_currsn_0_jdx_8_fsn_105_adsimgsn_0]: /images/20211227/403bc6852e2e498c8e471d93dfe60de8.png
[1573326-20190120113724250-1786051546.jpg]: /images/20211227/ae83e17f86af4696bbe56a07d453d993.png
[http_codeforces.com_problemset_problem_1084_A]: http://codeforces.com/problemset/problem/1084/A