@[William2019](/user/787512) 哪道题
by MANGO__FRIUT @ 2024-04-27 20:15:56
@[MANGO__FRIUT](/user/950891) 题目写了p10377
by qusia_MC @ 2024-04-28 14:44:33
```c
#include<bits/stdc++.h>
using namespace std;
struct node{
int a,b;
}cows[10];
int n,minn=INT_MAX;
bool bj[10];
int fzsx[10];
void add(){
int sum=1;
for(int i=2;i<=n;i++){
sum+=max(cows[fzsx[i]].b,cows[fzsx[i-1]].a);
sum+=1;
}
minn=min(minn,sum);
return ;
}
void dfs(int x){
if(x-1==n){
add();
return ;
}
for(int i=1;i<=n;i++){
if(!bj[i]){
fzsx[x]=i;
dfs(x+1);
bj[i]=0;
}
}
}
int main(){
cin>>n;// 输入 n
for(int i=1;i<=n;i++){
cin>>cows[i].a;
}
for(int i=1;i<=n;i++){
cin>>cows[i].b;
}
dfs(1);
cout<<minn<<"\n";// 输出最小值
return 0;
}
```
@[qusia_MC](/user/787512)
有可能不对
by MANGO__FRIUT @ 2024-05-04 22:34:42