Codeforces Round #325 (Div. 2) B. Laurenty and Shop 前缀和

时间:2022-09-22 18:25:26

B. Laurenty and Shop

Time Limit: 1 Sec

Memory Limit: 256 MB

题目连接

http://codeforces.com/contest/586/problem/B

Description

A little boy Laurenty has been playing his favourite game Nota for quite a while and is now very hungry. The boy wants to make sausage and cheese sandwiches, but first, he needs to buy a sausage and some cheese.

The town where Laurenty lives in is not large. The houses in it are located in two rows, n houses in each row. Laurenty lives in the very last house of the second row. The only shop in town is placed in the first house of the first row.

The first and second rows are separated with the main avenue of the city. The adjacent houses of one row are separated by streets.

Each crosswalk of a street or an avenue has some traffic lights. In order to cross the street, you need to press a button on the traffic light, wait for a while for the green light and cross the street. Different traffic lights can have different waiting time.

The traffic light on the crosswalk from the j-th house of the i-th row to the (j + 1)-th house of the same row has waiting time equal to aij (1 ≤ i ≤ 2, 1 ≤ j ≤ n - 1). For the traffic light on the crossing from the j-th house of one row to the j-th house of another row the waiting time equals bj (1 ≤ j ≤ n). The city doesn't have any other crossings.

The boy wants to get to the store, buy the products and go back. The main avenue of the city is wide enough, so the boy wants to cross it exactly once on the way to the store and exactly once on the way back home. The boy would get bored if he had to walk the same way again, so he wants the way home to be different from the way to the store in at least one crossing.

Codeforces Round #325 (Div. 2) B. Laurenty and Shop 前缀和 Figure to the first sample.

Help Laurenty determine the minimum total time he needs to wait at the crossroads.

Input

The first line of the input contains integer n (2 ≤ n ≤ 50) — the number of houses in each row.

Each of the next two lines contains n - 1 space-separated integer — values aij (1 ≤ aij ≤ 100).

The last line contains n space-separated integers bj (1 ≤ bj ≤ 100).

​i​​,C​i​​,即此题的初始分值、每分钟减少的分值、dxy做这道题需要花费的时间。

Output

Print a single integer — the least total time Laurenty needs to wait at the crossroads, given that he crosses the avenue only once both on his way to the store and on his way back home.

Sample Input

4
1 2 3
3 2 1
3 2 2 3

Sample Output

12

HINT

题意

给你两行房子,你得从第一行第一个走到第二行最后一个,并从第二行最后一个再走回去

每条路都有权值,并且你走过去和走回来的路线要求不一样,问你最小的花费是多少

题解:

首先统计前缀和之后,再暴力枚举中间走的过道是哪些就好了

代码:

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<iostream>
using namespace std; long long a[];
long long b[];
long long c[];
long long suma[];
long long sumb[];
int main()
{
int n;scanf("%d",&n);
for(int i=;i<n;i++)
{
scanf("%d",&a[i]);
suma[i]=a[i]+suma[i-];
}
for(int i=;i<n;i++)
{
scanf("%d",&b[i]);
sumb[i]=b[i]+sumb[i-];
}
for(int i=;i<=n;i++)
scanf("%d",&c[i]);
long long ans = -;
for(int i=;i<=n;i++)
{
for(int j=;j<=n;j++)
{
if(i==j)continue;
if(ans == -)
ans = (suma[i-]+sumb[n-]-sumb[i-]+c[i])+(suma[j-]+sumb[n-]-sumb[j-]+c[j]);
else
ans = min(ans,(suma[i-]+sumb[n-]-sumb[i-]+c[i])+(suma[j-]+sumb[n-]-sumb[j-]+c[j]));
}
}
cout<<ans<<endl;
}

Codeforces Round #325 (Div. 2) B. Laurenty and Shop 前缀和的更多相关文章

  1. Codeforces Round &num;325 &lpar;Div&period; 2&rpar; B&period; Laurenty and Shop 前缀&plus;后缀

                                                                                 B. Laurenty and Shop   ...

  2. Codeforces Round &num;325 &lpar;Div&period; 2&rpar; B&period; Laurenty and Shop 有规律的图 暴力枚举

    B. Laurenty and Shoptime limit per test1 secondmemory limit per test256 megabytesinputstandard input ...

  3. Codeforces Round &num;297 &lpar;Div&period; 2&rpar;B&period; Pasha and String 前缀和

    Codeforces Round #297 (Div. 2)B. Pasha and String Time Limit: 2 Sec  Memory Limit: 256 MBSubmit: xxx ...

  4. Codeforces Round &num;325 &lpar;Div&period; 2&rpar; B

    B. Laurenty and Shop time limit per test 1 second memory limit per test 256 megabytes input standard ...

  5. Codeforces Round &num;325 &lpar;Div&period; 2&rpar;

    水 A - Alena's Schedule /************************************************ * Author :Running_Time * Cr ...

  6. Codeforces Round &num;325 &lpar;Div&period; 2&rpar; Laurenty and Shop 模拟

    原题链接:http://codeforces.com/contest/586/problem/B 题意: 大概就是给你一个两行的路,让你寻找一个来回的最短路,并且不能走重复的路. 题解: 就枚举上下选 ...

  7. Codeforces Round &num;325 &lpar;Div&period; 2&rpar; F&period; Lizard Era&colon; Beginning meet in the mid

    F. Lizard Era: Beginning Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/5 ...

  8. Codeforces Round &num;325 &lpar;Div&period; 2&rpar; D&period; Phillip and Trains BFS

    D. Phillip and Trains Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/586/ ...

  9. Codeforces Round &num;325 &lpar;Div&period; 2&rpar; C&period; Gennady the Dentist 暴力

    C. Gennady the Dentist Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/586 ...

随机推荐

  1. 《Effective java》-----读书笔记

    2015年进步很小,看的书也不是很多,感觉自己都要废了,2016是沉淀的一年,在这一年中要不断学习.看书,努力提升自己!预计在2016年要看12本书,主要涉及java基础.Spring研究.java并 ...

  2. hbase hmaster故障分析及解决方案:Timedout 300000ms waiting for namespace table to be assigned

    最近生产环境hbase集群出现停掉集群之后hmaster无法启动现象,master日志报异常:Timedout 300000ms waiting for namespace table to be a ...

  3. 利用HttpListener创建简单的HTTP服务

    using System; using System.Collections.Generic; using System.IO; using System.IO.Compression; using ...

  4. AsyncQueryHandler 和 CursorAdapter的使用

    AsyncQueryHandler A helper class to help make handling asynchronous ContentResolver queries easier. ...

  5. 关于css样式的看法

    1.通常有两种方式,第一种是直接写在页面标签中,通过属性style,另一种是通过标签选择器赋样式 第一种方式,就是每一个标签都需要写一遍样式,同时没有做到样式和内容的分离,不方便以后的样式替换,主题的 ...

  6. bootstrap 模态框动态加载数据

    .页面中添加modal <!-- 模态框(Modal) --> <div class="modal fade" id="showModal" ...

  7. EhLib DBGridEh组件在Delphi中应用全攻略总结(转)

    EhLib DBGridEh组件在Delphi中应用全攻略总结(转) http://blog.sina.com.cn/s/blog_94b1b40001013xn0.html 优化SQL查询:如何写出 ...

  8. sql with as 用法&lpar;转载&rpar;

    一.WITH AS的含义     WITH AS短语,也叫做子查询部分(subquery factoring),可以让你做很多事情,定义一个SQL片断,该SQL片断会被整个SQL语句所用到.有的时候, ...

  9. 自动化测试框架Cucumber和RobotFramework的实战对比

    转自: http://www.infoq.com/cn/articles/cucumber-robotframework-comparison   一.摘要 自动化测试可以快速自动完成大量测试用例,节 ...

  10. CodeForces 732C Sanatorium

    C. Sanatorium time limit per test 1 second memory limit per test 256 megabytes input standard input ...