CF 586B 起点到终点的最短路和次短路之和

起点是右下角  终点是左上角

每次数据都是两行的点  输入n 表示有n列

接下来来的2行是 列与列之间的距离

最后一行是  行之间的距离

枚举就行

 

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

# include <iostream>
# include <cstdio>
# include <cstring>
# include <algorithm>
# include <string>
# include <cmath>
# include <queue>
# define LL long long
using namespace std ;

const int INF = 0x3f3f3f3f ;

int a[3][60] ;
int b[60] ;

int main()
{
    int n;
    while(scanf("%d",&n) != EOF)
    {
       int i , j ;
       int sum = 0 ;
       for (i = 0 ; i < 2  ; i++)
          for (j = 0 ; j < n-1 ; j++)
           scanf("%d" , &a[i][j]) ;
       for (i = 0 ; i < n  ; i++)
          scanf("%d" , &b[i]) ;
       int ans[3] = {INF , INF , INF} ;
       for (i = 0 ; i < n-1  ; i++)
       {
           sum += a[1][i] ;
       }
       sum += b[0] ;
       ans[2] = sum ;
       sort(ans , ans+3) ;
       for (i = 0 ; i < n-1  ; i++)
       {
           sum = sum - a[1][i] + a[0][i] ;
           sum = sum - b[i] + b[i+1] ;
           ans[2] = sum ;
           sort(ans , ans+3) ;
       }
       printf("%d
" , ans[0] + ans[1]) ;



    }
    return 0;
}