计算概论A代码总结Ⅱ（递归类）

笔者将考试可能遇到的问题大致归为基础算法类、递归类、动态规划类。本期是第二期递归类、同时也有一些回溯知识、

1.捕鱼问题

#include<iostream>
using namespace std;
int main() {
	int fish[5] = { 1,1,1,1,1 };//枚举ABCDE
	int i = 0;
	//这里do while的妙用，如何判断已全部循环完？i==-1
	do {
		fish[4] =fish[4]+ 5;
		for ( i = 3; i >= 0; i--) {//小心重定义
			if (fish[i + 1] % 4 != 0) { break; }
			else {
				fish[i] = fish[i + 1] * 5 / 4 + 1;
			}
		}
	} while (i >= 0);
	for (i = 0; i <=4; i++) {
		cout << fish[i] << endl;
	}return 0;
}

2.滑雪问题

//带记忆的递归dfs
//滑雪
#include<algorithm>
#include<iostream>
using namespace std;
const int N = 1000;
int dp[N][N];//从xy滑下的最大长度
int a[N][N];//原始的数据
int row; int col;
const int cx[] = { -1,1,0,0 };
const int cy[] = { 0,0,-1,1 };
int dfs(int x, int y) {
	if (dp[x][y] != 0)return dp[x][y];
	dp[x][y] = 1;
	for (int i = 0; i < 4; i++) {
		int xx = x + cx[i]; int yy = y + cy[i];
		if (xx >= 0 && xx < row&&yy >= 0 && yy < col&&a[xx][yy] < a[x][y]) {
			dp[x][y] = dfs(1, dfs(xx, yy) + 1);
		}
	}
	return dp[x][y];//直接返回的是数组内的元素
}//写nogo还是对弄清这个dfs有一定帮助
int main() {
	cin >> row >> col;
	for (int i = 0; i < row; i++) {
		for (int j = 0; j < col; j++) {
			cin >> a[i][j];
		}
	}
	memset(dp, 0, sizeof(dp));
	int ans = 0;
	for (int i = 0; i < row; i++) {
		for (int j = 0; j < row; j++) {
			ans = max(ans, dfs(i, j));
		}
	}
	cout << ans << endl; return 0;
}

3.回溯问题

（有正操作和逆操作，大体是一个思路

3.1城堡问题

此题注意取位运算的使用

 

//城堡问题
#include<iostream>
#include<stdio.h>
#include<cstring>
#include<algorithm>

using namespace std;
const int maxn = 100;
int r, c;
int room[maxn][maxn];
int visit[maxn][maxn];
int maxroomArea = 0; int roomNum = 0;
int roomArea;

void dfs(int i, int k) {
	if (visit[i][k])return;
	roomArea++;
	visit[i][k] = roomNum;
	if ((room[i][k] & 1) == 0)
		dfs(i, k - 1);//向左走
	if ((room[i][k] & 2) == 0)
		dfs(i - 1, k);//向上走
	if ((room[i][k] & 4) == 0)
		dfs(i, k + 1);//向右
	if ((room[i][k] & 8) == 0)
		dfs(i + 1, k);//向下
}
int main() {
	cin >> r >> c;
	for (int i = 1; i <= r; i++) {
		for (int j = 1; j <= c; j++) {
			cin >> room[i][j];
		}
	}
	memset(visit, 0, sizeof(visit));
	for (int i = 1; i <= r; i++) {
		for (int j = 1; j <= c; j++) {
			if (!visit[i][j]) {//学会深搜染色
				roomNum++;
				roomArea = 0;//每次深搜都重新赋值
				dfs(i, j);
				maxroomArea = max(roomArea, maxroomArea);
			}
		}
	}
	cout << roomNum << endl;
	cout << maxroomArea << endl;
}

3.2分书问题

分书问题√
和八皇后问题类似，是一个回溯版的问题
#include<iostream>
using namespace std;

int take[25];
int assigned[25];//记录第i本书是否找到了读者
int num = 0;
int like[25][25];
int n = 0;
void dfs(int id) {
	if (id == n) {
		for (int i = 0; i < n; i++) {//经典dfs回溯，主体都是要循环+operation+逆operation
			cout << take[i] + 1 << ' ';
		}
		cout << endl; return;
	}
	for (int i = 0; i < n; i++) {//为第i本书寻找合适的读者
		if (like[i][id] == 1 && !assigned[i]) {
			assigned[i] = 1;
			take[id] = i;//take为第id个人拿走第i本书
			dfs(id + 1);
			assigned[i] = false;
		}
	}
}
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			cin >> like[i][j];
		}
	}memset(take, 0, sizeof(take));
	memset(assigned, 0, sizeof(assigned));
	dfs(0);
	return 0;
}//题目描述可能有些问题
√

3.3八皇后问题

典中典！

八皇后问题，和分书问题都是经典的递归回溯问题
#include<iostream>
using namespace std;
char chessMap[8][8];
void init() {
	for (int i = 0; i < 8; i++) {
		for (int j = 0; j < 8; j++) {
			chessMap[i][j] = '.';
		}
	}
}
int num = 0;
void print() {
	cout << num << endl;
	for (int i = 0; i < 8; i++) {
		cout << chessMap[i][0];
		for (int j = 1; j < 8; j++) {
			cout<<' '<<chessMap[i][j];
		}cout << endl;
	}
}
bool isok(int row, int col) {
	for (int d = 0; row + d < 8; d++) {
		if (chessMap[row + d][col] == '*')return false;
	}
	for (int d = 0; row - d >= 0; d++) {
		if (chessMap[row - d][col] == '*')return false;
	}
	for (int d = 0; col + d < 8; d++) {
		if (chessMap[row][col+d] == '*')return false;
	}
	for (int d = 0; col - d >= 0; d++) {
		if (chessMap[row][col-d] == '*')return false;
	}
	for (int d = 0; col + d < 8 && row + d < 8; d++) {
		if (chessMap[row + d][col + d] == '*')return false;
	}
	for (int d = 0; row - d >= 0 && col + d < 8; d++) {
		if (chessMap[row - d][col + d] == '*')return false;
	}
	for (int d = 0; row - d >= 0 && col - d >= 0; d++) {
		if (chessMap[row - d][col - d] == '*')return false;
	}
	for (int d = 0; row + d < 8 && col - d >= 0; d++) {
		if (chessMap[row + d][col - d] == '*')return false;
	}return true;
}
void queue(int row) {
	if (row == 8) {
		num++;
		print(); return;
	}
	for (int col = 0; col < 8; col++) {
		if (isok(row, col)) {
			chessMap[row][col] = '*';
			queue(row + 1);
			chessMap[row][col] = '.';
		}
	}
}
int main() {
	init();
	queue(0);
	return 0;
}

3.4跳马问题

跳马问题√
#include<iostream>
#include<iomanip>
using namespace std;
int dx[] = { 2,1,-2,-1,-2,-1,1,2 };
int dy[] = { 1,2,1,2,-1,-2,-2,-1 };

int take[6][6];
int total;
bool visit[6][6];

void print() {
	if (total > 5)return;
	for (int i = 0; i < 5; i++) {
		for (int j = 0; j < 5; j++) {
			cout << setw(5) << take[i][j];
		}
		cout << endl;
	}
	cout << endl;
	return;
}

bool inchessboard(int x, int y) {
	return x >= 0 && y >= 0 && x < 5 && y < 5;
}

void dfs(int x, int y, int s) {
	if (s == 26) {
		total++;
		print(); return;
	}
	for (int i = 0; i < 8; i++) {
		int xx = x + dx[i]; int yy = y + dy[i];
		if (!visit[xx][yy] && inchessboard(xx, yy)) {
			visit[xx][yy] = 1;
			take[xx][yy] = s;
			dfs(xx, yy, s + 1);
			visit[xx][yy] = 0;
		}
	}
}

int main() {
	total = 0;
	memset(take, 0, sizeof(take));
	memset(visit, 0, sizeof(visit));
	visit[0][0] = 1;
	take[0][0] = 1;
	dfs(0, 0, 2);
	cout << total << endl;
}

4.魔王军队

//魔王军队√
//中间商作差价，关键在于更新起点士兵，直到起点士兵能够覆盖n，注意，中间点就是range所确定的
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 50010;
int n; int r;
int s[maxn] = { 0 };

int range(int l) {
	int ret = l;
	while (ret < n&&s[ret] - s[l] <= r) {
		ret++;
	}
	return ret;
}



int main() {
	n = 0; r = 0; int l; int cnt;
	while (cin >> r >> n) {
		if (n < 0 && r < 0)return 0;
		for (int i = 0; i < n; i++) {
			cin >> s[i];
		}
		sort(s, s + n); cnt = 0;
		l = 0;//更新起点
		while (l < n) {
			cnt++;
			l = range(range(l) - 1);//里面是终点
		}
		cout << cnt << endl;

	}
}√