第八章搜索

1.DFS深度优先搜索(由栈实现)：

#define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include<vector>
#include<iostream>
const int maxn = 10010;
int n,k,x,maxsumsqr=-1,A[maxn];
using namespace std;
vector<int> ans, temp;
void DFS(int index, int nowk, int sum, int sumsqr) {
	if (nowk == k && sum == x) {
		if (sumsqr > maxsumsqr) {
			maxsumsqr = sumsqr;
			ans = temp;
		}
		return;
	}
	if (index == n || nowk > k || sum > x)return;
	temp.push_back(A[index]);
	DFS(index + 1, nowk + 1, sum + A[index], sumsqr + A[index] * A[index]);
	temp.pop_back();
	DFS(index+1,nowk, sum, sumsqr);
}
int main() {
	scanf("%d%d%d", &n,&k,&x);	
	for (int i = 0; i < n; i++) {
		scanf("%d", &A[i]);
	}
	DFS(0, 0, 0, 0);
	vector<int>::iterator it;
	it=ans.begin();
	for (int j = 0; j < k; j++) {
		cout<< *it << " ";
		it++;
	}
	return 0;
}

编写的时候碰到好几个坑，debug了一两个小时，还是单步调试好…不能着急。碰到vector使用出现问题时千万不要怀疑报错的理由是编译器的问题，如果调用不当也会导致vector报错。递归的方式实现深度优先搜索，每个数字有选和不选两个选择，如果选择了后面记得再从vector中弹出防止干扰不选的那一条通路。
2.BFS广度优先搜索(由队列实现)

实现C++代码如下：

#define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include<queue>
using namespace std;
const int maxn = 100;
int m, n;
int num[maxn][maxn];
int zengx[4] = { 1,-1, 0, 0 };
int zengy[4] = { 0,0, 1, -1 };
struct Node {
	int x;	
	int y;
}node,newnode;
queue<Node>q;
bool inq[maxn][maxn] = { false };
bool judge(int x, int y,int m,int n) {
	if (x < 0 || x >= m || y < 0 || y >= n)return false;
	if (num[x][y] == 0 || inq[x][y] == true)return false;
	return true;
}
void BFS(int x, int y) {
	int newx, newy;
	node.x = x; node.y = y;
	q.push(node);
	inq[x][y] = true;
	while (!q.empty()) {
		node = q.front();
		q.pop();
		for (int i = 0; i < 4; i++) {
			newx = node.x + zengx[i];
			newy = node.y + zengy[i];
			if (judge(newx, newy, m, n) && inq[newx][newy] == false) {
				inq[newx][newy] = true;
				newnode.x = newx;
				newnode.y = newy;
				q.push(newnode);
			}
		}
	}
}
int main() {
	int count = 0;
	scanf("%d %d", &m, &n);
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < n; j++) {
			scanf("%d", &num[i][j]);
		}
	}
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < n; j++) {
			if (judge(i, j, m, n)&&inq[i][j]!=true) {
				count++;
				BFS(i, j);
			}
		}
	}
	printf("%d", count);
	return 0;
}

其中BFS采用队列实现。