短学期Day.6(搜索)

https://www.luogu.com.cn/problem/P1219（八皇后问题）

#include<iostream>
using namespace std;
int n, a[1000], b[1000], c[1000], d[1000], s;
void search(int i) {
	
	
		for (int j = 1; j <= n; j++) {
			if (b[j] == 0 && c[i + j] == 0 && d[i - j + n] == 0) {
				a[i] = j;
				b[j] = 1;
				c[i + j] = 1;
				d[i - j + n] = 1;
				if (i == n) {
					s++;
					if (s <= 3) {
						for (int i = 1; i <= n; i++) {
							cout << a[i] << " ";
						}
						cout << endl;
					}
				}
				else search(i + 1);
				b[j] = 0;
				c[i + j] = 0;
				d[i - j + n] = 0;
			}
		}
	
}
int main() {
	cin >> n;
	search(1);
	cout << s << endl;
	return 0;
}

解题关键：回溯
https://www.luogu.com.cn/problem/P1135

#include<iostream>
#include<algorithm>
using namespace std;
int p[205], t[205];
int n, a, b, ans=0x7ffffff;
void my_find(int i,int x) {
	if (i == b) {
		ans = min(ans, x);
	}
	if (x > ans) {
		return;
	}
	//t[i] = 1;
	if (i + p[i] <= n && t[i + p[i]] == 0) {
		t[i + p[i]] = 1;
		my_find(i + p[i], x + 1);
		t[i + p[i]] = 0;
	}

	if (i - p[i] >= 0 && t[i - p[i]] == 0) {
		t[i - p[i]] = 1;
		my_find(i - p[i], x + 1);
		t[i - p[i]] = 0;
	}
	//t[i] = 0;
}
int main() {
	
	cin >> n >> a >> b;
	int i;
	for (i = 1; i <= n; i++) {
		cin >> p[i];
	}
	my_find(a, 0);
	if (ans != 0x7ffffff) {
		cout << ans << endl;
	}
	else {
		cout << "-1" << endl;
	}
	return 0;
}
//重要的事情说三遍：回溯，回溯，回溯