# 一个节点数的计算和遍历的问题，广度优先搜索，采用C语言的实现方式

Problem Description
Far away from our world, there is a banana forest. And many lovely monkeys live there. One day, SDH(Song Da Hou), who is the king of banana forest, decides to hold a big party to celebrate Crazy Bananas Day. But the little monkeys don't know each other, so as the king, SDH must do something.
Now there are n monkeys sitting in a circle, and each monkey has a making friends time. Also, each monkey has two neighbor. SDH wants to introduce them to each other, and the rules are:
1.every time, he can only introduce one monkey and one of this monkey's neighbor.
2.if he introduce A and B, then every monkey A already knows will know every monkey B already knows, and the total time for this introducing is the sum of the making friends time of all the monkeys A and B already knows;
3.each little monkey knows himself;
In order to begin the party and eat bananas as soon as possible, SDH want to know the mininal time he needs on introducing.

Input
There is several test cases. In each case, the first line is n(1 ≤ n ≤ 1000), which is the number of monkeys. The next line contains n positive integers(less than 1000), means the making friends time(in order, the first one and the last one are neighbors). The input is end of file.

Output
For each case, you should print a line giving the mininal time SDH needs on introducing.

Sample Input
8
5 2 4 7 6 1 3 9

Sample Output
105

• 写回答

#### 1条回答默认 最新

• threenewbee 2019-12-31 02:09
关注
本回答被题主选为最佳回答 , 对您是否有帮助呢?
评论

#### 悬赏问题

• ¥15 MddBootstrapInitialize2失败
• ¥15 LCD Flicker
• ¥15 Spring MVC项目，访问不到相应的控制器方法
• ¥15 esp32在micropython环境下使用ssl/tls连接mqtt服务器出现以下报错Connected on 192.168.154.223发生意外错误: 5无法连接到 MQTT 代理，如何解决？
• ¥15 关于#genesiscsheel#的问题，如何解决？
• ¥15 Android aidl for hal
• ¥15 STM32CubeIDE下载程序报错
• ¥15 微信好友如何转变为会员系统？（相关搜索：小程序）
• ¥15 c# 直接使用c++ 类库文件
• ¥15 一个主机电脑有两个显示器，当前有两个软件主体是网页html打包的exe程序，如何通过cmd命令bat同时打开软件一个在主屏幕显示，另外一个软件在2副屏幕上显示