Codeforces Round #325 (Div. 2) B. Laurenty and Shop 有规律的图 暴力枚举

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, nhouses 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.

题意分析：两排房子，你在最左上角的一排，求到达最右下角的房子的两条最短路径之和；

错因分析：一开始准备用Dijjkstra求短路和次短路的，写了一会儿发现比较麻烦，n只有50，dfs似乎简单些，然后又用dfs坐了一会儿，后来再发现，dfs都不要，直接暴力枚举在两个房子前过街就行了，因为这个图太有规律性，而且n又不大，完全可以暴力枚举。

#include<cstdio>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <set>
using namespace std;
#define MM(a) memset(a,0,sizeof(a))
typedef long long LL;
typedef unsigned long long ULL;
const int mod = ;
const double eps = 1e-;
const int inf = 0x3f3f3f3f;
int cost,dist,dist2;
int n,a[],b[],c[];
int main()
{
    while(~scanf("%d",&n))
    {
       a[]=;b[]=;
       for(int i=;i<=n;i++)
       {
           cin>>a[i];
           a[i]+=a[i-];    //直接数组求和，不必保存单条路径的值
       }
       for(int i=;i<=n;i++)
          {
              cin>>b[i];
              b[i]+=b[i-];
          }
        for(int i=;i<=n;i++)
            cin>>c[i];
        int sum=inf;
       for(int i=;i<=n-;i++)
       {
            for(int j=i+;j<=n;j++)
            {                              //两层暴力枚举
                int cost1=c[i]+a[i]+b[n]-b[i];
                int cost2=c[j]+a[j]+b[n]-b[j];
                if(sum>cost1+cost2)
                   sum=cost1+cost2;
            }
       }
       printf("%d\n",sum);
    }
    return ;
}