搜索之记忆化搜索

本篇为三个例题

P1514 引水入城

• 记忆顶层的最长覆盖区间
• 若底层存在未访问的城市，输出0；若底层城市都能访问到，根据顶层的最长覆盖区间贪心选择最少的顶层城市

#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e2 + 10;
int n, m;
int x[4] = {-1, 1, 0, 0}, y[4] = {0, 0, 1, -1};
// 最长覆盖区间，分别用两个数组存储左端点以及右端点
int h[maxn][maxn], l[maxn][maxn], r[maxn][maxn];
bool vis[maxn][maxn];
void dfs(int tx, int ty) {
    vis[tx][ty] = true;
    int nx, ny;
    for (int i = 0; i <= 3; i++) {
        nx = tx + x[i], ny = ty + y[i];
        if (nx < 1 || nx > n || ny < 1 || ny > m || h[nx][ny] >= h[tx][ty]) continue;
        if (!vis[nx][ny]) dfs(nx, ny);
        l[tx][ty] = min(l[tx][ty], l[nx][ny]), r[tx][ty] = max(r[tx][ty], r[nx][ny]);
    }
}
int main() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            cin >> h[i][j], l[i][j] = m;
    for (int i = 1; i <= m; i++) l[n][i] = r[n][i] = i;//初始化
    for (int i = 1; i <= m; i++)
        if (!vis[1][i]) dfs(1, i);
    int cnt = 0;
    for (int i = 1; i <= m; i++)
        cnt += vis[n][i];
    if (cnt != m) {
        cout << 0 << endl << m - cnt << endl;
        return 0;
    }
    cnt = 0;
    int lef = 1;
    while (lef <= m) {//贪心选取
        int maxr = 0;
        for (int i = 1; i <= m; i++)
        //之前选过的必然不可能再选，因为显然有更“右边”的区间比它更优
            if (l[1][i] <= lef)
                maxr = max(maxr, r[1][i]);
        cnt++;
        lef = maxr + 1; 
    }
    cout << 1 << endl << cnt << endl;
    return 0;
}

P1535 游荡的奶牛

爆搜过不了
需要记忆化 + 剪枝
记忆化搜索需要一个三维数组f[x][y][time]
表示方案数
怎么说呢，f[r2][c2][t] = 1, 最终f[r1][c1][0] 为答案，也就是可以理解为它是倒着统计总方案数的

#include<bits/stdc++.h>
using namespace std;
int n, m, t, r1, c1, r2, c2;
char mapp[105][105];
int f[105][105][17];
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int dfs(int r, int c, int tim) {
	if(f[r][c][tim] != -1) return f[r][c][tim]; 
	if(tim > t) return f[r][c][tim] = 0;
	if(abs(r-r2) + abs(c-c2) > (t - tim)) return f[r][c][tim] = 0;
	if(tim == t) {
		if(r == r2 && c == c2) {
			return f[r][c][tim] = 1;
		}else {
			return f[r][c][tim] = 0;
		}
	}
	int ans = 0;
	for(int i = 0; i < 4; i++) {
		int tx = r + dx[i];
		int ty = c + dy[i];
		if(tx <= 0 || tx > n || ty <= 0 || ty > m || mapp[tx][ty] == '*') continue;
		ans += dfs(tx, ty, tim + 1);
	}
	return f[r][c][tim] = ans;
}

int main() {
	ios::sync_with_stdio(false);
	cin >> n >> m >> t;
	memset(f, -1, sizeof(f));
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= m; j++) {
			cin >> mapp[i][j];
		}
	}
	cin >> r1 >> c1 >> r2 >> c2;
	int ans = dfs(r1, c1, 0);
	cout << ans;
	return 0;
}

P3953 逛公园

dp[i][j]记录从(i,j)点出发最长的滑雪长度

#include<iostream>
using namespace std;

int nums[102][102];
int dp[102][102];
int dirx[4] = {0, 0, 1, -1};
int diry[4] = {1, -1, 0, 0};
int r, c;

int skate(int i, int j) {
	if(dp[i][j] > 0) {
		return dp[i][j];//若该点经过返回现有值
	}
	else {
		dp[i][j] = 1;//反之为滑雪首地点
	}
	for(int k = 0; k < 4; k++) {
		int newi = i + dirx[k];
		int newj = j + diry[k];
		if(nums[i][j] > nums[newi][newj] && newi >= 0 && newi < r && newj >= 0 && newj < c) {
			dp[newi][newj] = skate(newi,newj);
			dp[i][j] = max(dp[i][j], dp[newi][newj] + 1);
		}
	}
	return dp[i][j];
}

int main() {
	cin>>r>>c;
	for(int i = 0; i < r; i++) {
		for(int j = 0; j < c; j++) {
			cin>>nums[i][j];
		}
	}
	int ans = 0;
	for(int i = 0; i < r; i++) {
		for(int j = 0; j < c; j++) {
			ans = max(ans, skate(i, j));
		}
	}
	cout<<ans;
	//getchar();
	return 0;
}```