思路一:每次dfs寻找一个可行方案,记得每次dfs后都要给visited数组置零
#include <bits/stdc++.h>
using namespace std;
const int N=40;
int a,b,n,ans;
int hotel_distance[N]={
0,990,1010,1970,2030,2940,3060,3930,4060,4970,5030,5990,6010,7000};
int visited[N];
void dfs(int km){
for(int i=1;i<n+14;i++){
if(hotel_distance[i]>=km+a&&hotel_distance[i]<=km+b&&!visited[i]){
if