cf 325-B

         B. Laurenty and Shop

time limit per test：1 second
memory limit per test：256 megabytes
input：standard input
output：standard output
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.

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).

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 test(s)
input
4
1 2 3
3 2 1
3 2 2 3
output
12
input
3
1 2
3 3
2 1 3
output
11
input
2
1
1
1 1
output
4
Note
The 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.

这道题目的意思是这个小孩住在一条只有两排房子的大街上，每排房子有n个房子，两排中间有一条大道，每个房子中间有一个小道，每过一次路都要停下来等红绿灯，红绿灯的时间不定。他家住在第二排的最后一个房子，他要去第一排的第一个房子买东西再回来。要求计算最短等候时间并且来回的路至少有一个路口不一样。

#include<stdio.h>

int main()
{
    int a[2][50],b[50];
    int i,j,k,n,sum1,sum2,tmp;
    int min1,min2;

    scanf("%d",&n);
    for(i=0;i<n-1;i++)
    {
        scanf("%d",&a[0][i]);
    }
    for(i=0;i<n-1;i++)
    {
        scanf("%d",&a[1][i]);
    }
    for(i=0;i<n;i++)
    {
        scanf("%d",&b[i]);
    }

    sum1 = sum2 = 0;
    min1 = min2 = 10000;
    for(i = 0; i < n - 1; i++)
    {
        sum2 += a[1][i];
    }
    for(i = 0; i < n; i++)
    {
        tmp = sum1 + sum2 + b[i];
        if(min1 > tmp)
        {
            min2 = min1;
            min1 = tmp;
        }
        else if(min2 > tmp)
        {
            min2 = tmp;
        }

        if(i != n - 1)
        {
            sum1 += a[0][i];
            sum2 -= a[1][i];
        }
    }
    printf("%d\n",min1 + min2);
    return 0;
}

我有无耻的抄了别人的代码，因为我并不会写。如上代码定义了两个数组存放横着的等待时间和竖着的等待时间（当然也能开三个不过显得很蠢也很难读懂代码），输入n后用三个for循环分别对等待时间进行了读取。然后定义了两个和变量、两个最小时间变量，先加上所有的第二排等待时间然后依次加上b[i]来取代min1和min2。并在i != n - 1的时候进行依次的sum1和sum2的递增与递减。最终输出两个和时间的总时间就是最终结果。这种方法保证了sum1和sum2肯定不是两个完全相等的路径且逻辑简单。主要是我能看得懂所以我就抄下来了hhh。。。