CodeForces - 586B
2018-03-21 11:16
417 查看
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.
Figure to the first sample.Help Laurenty determine the minimum total time he needs to wait at the crossroads.
InputThe 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).
OutputPrint 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.
ExampleInput
In the second sample, Laurenty's path can look as follows:
Laurenty crosses the avenue, the waiting time is 3;
Laurenty uses the second crossing in the first row, the waiting time is 2;
Laurenty uses the first crossing in the first row, the waiting time is 1;
Laurenty uses the first crossing in the first row, the waiting time is 1;
Laurenty crosses the avenue, the waiting time is 1;
Laurenty uses the second crossing in the second row, the waiting time is 3.In total we get that the answer equals 11.In the last sample Laurenty visits all the crossings, so the answer is 4.
此题数据不大,可以直接用暴力的方法求出所有可能情况,比大小就可以了,但是他来回好像不走同一条路
刚开始坑了一下
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
using namespace std;
const int maxn=1e5+5;
int a[55];
int b[55],c[55];
int sum[maxn];
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<n;i++)
scanf("%d",&a[i]);
for(int i=1;i<n;i++)
scanf("%d",&b[i]);
for(int i=1;i<=n;i++)
scanf("%d",&c[i]);
for(int i=1;i<=n;i++)//在i处拐弯
{
int num=0;
for(int j=1;j<=i;j++)
{
num+=a[j-1];
}
num+=c[i];//竖直的路一定要走
for(int j=i;j<=n;j++)
{
num+=b[j];
}
sum[i]=num;
}
sort(sum+1,sum+n+1);
printf("%d\n",sum[1]+sum[2]);
return 0;
}
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.
Figure to the first sample.Help Laurenty determine the minimum total time he needs to wait at the crossroads.
InputThe 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).
OutputPrint 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.
ExampleInput
4 1 2 3 3 2 1 3 2 2 3Output
12Input
3 1 2 3 3 2 1 3Output
11Input
2 1 1 1 1Output
4NoteThe first sample is shown on the figure above.
In the second sample, Laurenty's path can look as follows:
Laurenty crosses the avenue, the waiting time is 3;
Laurenty uses the second crossing in the first row, the waiting time is 2;
Laurenty uses the first crossing in the first row, the waiting time is 1;
Laurenty uses the first crossing in the first row, the waiting time is 1;
Laurenty crosses the avenue, the waiting time is 1;
Laurenty uses the second crossing in the second row, the waiting time is 3.In total we get that the answer equals 11.In the last sample Laurenty visits all the crossings, so the answer is 4.
此题数据不大,可以直接用暴力的方法求出所有可能情况,比大小就可以了,但是他来回好像不走同一条路
刚开始坑了一下
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
using namespace std;
const int maxn=1e5+5;
int a[55];
int b[55],c[55];
int sum[maxn];
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<n;i++)
scanf("%d",&a[i]);
for(int i=1;i<n;i++)
scanf("%d",&b[i]);
for(int i=1;i<=n;i++)
scanf("%d",&c[i]);
for(int i=1;i<=n;i++)//在i处拐弯
{
int num=0;
for(int j=1;j<=i;j++)
{
num+=a[j-1];
}
num+=c[i];//竖直的路一定要走
for(int j=i;j<=n;j++)
{
num+=b[j];
}
sum[i]=num;
}
sort(sum+1,sum+n+1);
printf("%d\n",sum[1]+sum[2]);
return 0;
}
相关文章推荐
- CodeForces 586B
- 【CodeForces 830A】Office Keys
- CodeForces 37 D.Lesson Timetable(组合数学+dp)
- Codeforces_(A).Array
- CodeForces 151B Phone Numbers(简单模拟)
- Codeforces 193 D. Two Segments
- codeforces 678D Iterated Linear Function 矩阵快速幂
- CodeForces 111B(数组模拟,记录因子位置)
- CodeForces - 598B Queries on a String
- codeforces 546e Soldier and Traveling
- codeforces 95D 统计幸运数位置不超过k的数字
- Codeforces 134C Swaps
- codeforces 918C(思维)
- CodeForces 567A Lineland Mail
- 【Codeforces 729 A Interview with Oleg 】
- codeforces—— 270A —— Fancy Fence
- codeforces 899e Segments Removal
- codeforces 183(div2) A. Pythagorean Theorem II 枚举+二分查找
- CodeForces 66D--思维(yy)
- CodeForces-767C Garland 三分一棵树的价值