算法设计与分析 作业7

6-44 求子集和问题（回溯法） (10 分)

void dfs(int tw,int rw,int x[],int i)
{
    if(tw + rw < W) return;
    if(i > n + 1) return;
  //  cout << tw << ' ' << i << endl;
    
    if(tw == W){
        dispasolution(x);
        return;
    }
    
    x[i] = 1;
    dfs(tw + w[i],rw - w[i],x,i + 1);
    x[i] = 0;
    dfs(tw,rw - w[i],x,i + 1);
}

6-45 求解n皇后问题（非递归回溯法） (10 分)

void Queens(int line)
{
  
	int row = 1;					//row表示当前行数，通过row的变化更改数组中的值，当row大于规模时表示得出一个答案，当row小于1时表示全部遍历完成
	q[1] = 1;
	while (row > 0) {
		if (row <= line && q[row] <= line) {	//当row小于规模和数组内容小于规模，说明当前row的指示还在棋盘中
			if (!place(row))
				q[row]++;
			else {
				row++;			//进入下一行
				q[row] = 1;		//列数置为1
			}
			//nodeNum++;			
		}
		else {
			if (row > line) {
				dispasolution(line);
			}
			row--;			//回到上一行
			q[row]++;		//并且列数增加
		}
	}
}
// https://blog.csdn.net/chenxianqin2/article/details/79087035

6-46 最短路径（队列式分枝限界法） (10 分)

void bfs()
{
    bool st[MAXN];
    memset(st,0,sizeof st);
    queue<int>q;
    q.push(v);
    dist[v] = 0;
    
    while(q.size())
    {
        int t = q.front();
        q.pop();
        st[t] = false;
        
        for(int i = 0;i < n;i ++){
            if(dist[i] > dist[t] + a[t][i]){
                dist[i] = dist[t] + a[t][i];
                if(st[i]) continue;
                q.push(i);
                st[i] = true;
            }
        }
    }
}
void dispallpath()
{
    for(int i = 0;i < n;i ++){
        if(i != v){
            if(dist[i] == 0x3f3f3f3f){
                cout << 0 << endl;
            }
            else
                cout << dist[i] << endl;    
        }
        
    }
}

7-62 前t个组合结果 (25 分)

#include <iostream>
using namespace std;

int n,r,t;
int m;
const int N = 31;

bool st[N];
int a[N];
void dfs(int num,int id)
{
    if(m >= t) return;
    
    if(id == r){
        for(int i = 0;i < r;i ++){
            cout << ' ' << a[i];
        }
        cout << endl;
        m ++;
        return;
    }
    if(num <= 0) return;
    a[id] = num;
    dfs(num - 1,id + 1);
    dfs(num - 1,id);
}

int main()
{
    while(cin >> n >> r >> t){
        m = 0;
        dfs(n,0);
        m = 0;
    }
    return 0;
}
/*
5 4 3  5 4 3
5 4 2 
5 4 1 
5 3 2 
5 3 1 
5 2 1 
4 3 2 
4 3 1 
4 2 1 
3 2 1 
*/

7-63 自然数拆分问题 (60 分)

#include <iostream>
#include <vector>
using namespace std;

int n,r,t;
int m;
const int N = 60;

bool st[N];
int a[N];
vector<int>vec;

void dfs(int num,int s)
{
    if(num == 0){
        cout << n << "=" << vec[0];
        for(int i = 1;i < vec.size();i ++){
            cout << "+" << vec[i];
        }
        cout << endl;
        return;
    }
    
    for(int i = s;i <= num;i ++){
        vec.push_back(i);
        dfs(num - i,i);
        vec.pop_back();
    }
    
}

int main()
{
    ios::sync_with_stdio(false);
    cin >> n;
    dfs(n,1);
    
    return 0;
}
/*
5 4 3  5 4 3
5 4 2 
5 4 1 
5 3 2 
5 3 1 
5 2 1 
4 3 2 
4 3 1 
4 2 1 
3 2 1 
*/

7-64 字母排列问题 (10 分)

#include <iostream>
#include <vector>
using namespace std;
int n,m;
string str;
bool st[30];

void dfs(int cnt)
{
    if(cnt == m){
        for(int i = 0;i < m;i ++){
            printf("%c",str[i]);
        }
        printf("\n");
        return;
    }
    
    for(int i = 0;i < n;i ++){
        char c = i + 'A';
        if(st[i]) continue;
        str = str + c;
        st[i] = true;
        dfs(cnt + 1);
        st[i] = false;
        str.pop_back();
    }
    
    
}

int main()
{
    scanf("%d%d",&n,&m);
    dfs(0);
    return 0;
}
/*
AB
AC
BA
BC
CA
CB
*/

7-65 八皇后问题 (20 分)

#include <stdio.h>  
#include <math.h>  
int queenPlaces[92][8]; //存放92种皇后棋子的摆放方法  
int count = 0;  
int board[8][8]; //仿真棋盘  
void putQueen(int ithQueen); //递归函数，每次摆好一个棋子  

int main()  
{  
   int n, i, j;    
    for(i = 0; i < 8; i++){  // 初始化  
        for(j = 0; j < 8; j++)  
            board[i][j] = -1;  
        for(j = 0; j < 92; j++)  
            queenPlaces[j][i] = 0;  
    }  
    putQueen(0); //从第0个棋子开始摆放，运行的结果是将queenPlaces生成好  
   scanf("%d", &n);  
   for(i = 0; i < n; i++){  
        int ith;  
        scanf("%d", &ith);  
        for(j = 0; j < 8; j++)  
           printf("%d", queenPlaces[ith - 1][j]);  
        printf("\n");  
    }  
}  
void putQueen(int ithQueen){  
     int i, k, r;  
     if(ithQueen == 8){  
         count ++;  
         return;  
     }  
     for(i = 0; i < 8; i++){  
         if(board[i][ithQueen] == -1){  
             //摆放皇后  
             board[i][ithQueen] = ithQueen;  
             //将其后所有的摆放方法的第ith个皇后都放在i+1的位置上  
             //在i增加以后，后面的第ith个皇后摆放方法后覆盖此时的设置  
             for(k = count; k < 92; k++)  
                 queenPlaces[k][ithQueen] = i + 1;  
             //设置控制范围  
             for(k = 0; k < 8; k++)  
             for(r = 0; r < 8; r++)  
                 if(board[k][r] == -1 &&   
                     (k == i || r == ithQueen || abs(k - i) == abs(r - ithQueen)))   
                     board[k][r] = ithQueen;  
             //向下级递归  
             putQueen(ithQueen + 1);  
             //回溯，撤销控制范围  
             for(k = 0; k < 8; k++)  
             for(r = 0; r < 8; r++)  
                     if(board[k][r] == ithQueen) board[k][r] = -1;  
         }  
     }  
}  

7-66 旅行售货员 (10 分)

#include <cstring>
#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;

int n;
vector<int> path;
const int N = 10;

int g[N][N];
int ans = 0x3f3f3f3f;

void dfs(int u, int state)
{
    if (u == n)
    {
        int sum = 0;
        
        for(int i = 0;i < path.size() - 1;i ++){
            sum += g[path[i]][path[i + 1]];
        }
        sum += g[path[path.size() - 1]][path[0]];
        
        // cout << endl;
        ans = min(ans,sum);
        return;
    }

    for (int i = 0; i < n; i ++ )
        if (!(state >> i & 1))
        {
            path.push_back(i + 1);
            dfs(u + 1, state + (1 << i));
            path.pop_back();
        }
}

int main()
{
    cin >> n;
    for(int i = 1;i <= n;i ++)
        for(int j = 1;j <= n;j ++)
                cin >> g[i][j];
    
    dfs(0, 0);
    
    cout << ans << endl;
    
    return 0;
}