L3-004 肿瘤诊断 (30 分)（三维 bfs

lcxdz

于 2022-04-21 21:21:04 发布

阅读量123

点赞数

CC 4.0 BY-SA版权

分类专栏：思维文章标签：算法 c++ c语言

本文链接：https://blog.csdn.net/Minelois/article/details/124332081

思维专栏收录该内容

237 篇文章

订阅专栏

本文介绍如何使用C++实现深度优先搜索(DFS)，解决在给定网格地图中寻找从起点到终点的最短路径问题，重点在于理解并应用DFS算法及其在实际问题中的应用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <bits/stdc++.h>
using namespace std;
int n, m, l, t;
const int N = 1300, M = 150, H = 70;
int arr[N][M][H], vis[N][M][H];
struct node
{
    int x, y, z;
};
int dx[] = {0, 0, 0, 0, 1, -1};
int dy[] = {0, 0, 1, -1, 0, 0};
int dz[] = {1, -1, 0, 0, 0, 0};
int dfs(int x, int y, int z)
{
    int ans = 0;
    queue<node> q;
    q.push({x, y, z});
    vis[x][y][z]=1;
    while (q.size())
    {
        auto p = q.front();
        q.pop();
        ans++;
        for (int i = 0; i < 6; i++)
        {
            int nx = dx[i] + p.x, ny = dy[i] + p.y, nz = dz[i] + p.z;
            if (nx < 1 || nx > n || ny < 1 || ny > m || nz < 1 || nz > l)
                continue;
            if (arr[nx][ny][nz] == 0)
                continue;
            if(vis[nx][ny][nz])continue;
            vis[nx][ny][nz]=1;
            q.push({nx, ny, nz});
            
        }
    }
    if (ans < t)
        ans = 0;
    return ans;
}
int main()
{
    cin >> n >> m >> l >> t;
    for (int k = 1; k <= l; k++)
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= m; j++)
            {
                cin >> arr[i][j][k];
            }
        }
    int ans = 0;
    for (int k = 1; k <= l; k++)
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= m; j++)
            {
                if (!vis[i][j][k] && arr[i][j][k])
                {
                    // cout<<i<<" "<<j<<" "<<k<<"\n";
                    // cout<<dfs(i,j,k)<<"\n";
                    ans += dfs(i, j, k);
                }
            }
        }
        cout<<ans<<"\n";
    return 0;
}