就是三维的dfs或者bfs
dfs:(内存超限)
#include<cstdio>
int rowNum, columnNum, depthNum, threshold;
using namespace std;
int slice[70][1300][130] = { 0 };
int dfs(int depth, int row, int column) {
if (slice[depth][row][column] == 0)
return 0;
slice[depth][row][column] = 0;
int strokeCount = 0;
strokeCount++;
strokeCount += dfs(depth - 1, row, column);
strokeCount += dfs(depth + 1, row, column);
strokeCount += dfs(depth, row - 1, column);
strokeCount += dfs(depth, row + 1, column);
strokeCount += dfs(depth, row, column - 1);
strokeCount += dfs(depth, row, column + 1);
return strokeCount;
}
int main() {
scanf("%d %d %d %d", &rowNum, &columnNum, &depthNum, &threshold);
for (int d = 1;d <= depthNum;d++) {
for (int i = 1;i <= rowNum;i++) {
for (int j = 1;j <= columnNum;j++) {
scanf("%d", &slice[d][i][j]);
}
}
}
int strokeSum = 0;
for (int d = 1;d <= depthNum;d++) {
for (int i = 1;i <= rowNum;i++) {
for (int j = 1;j <= columnNum;j++) {
int temp = dfs(d, i, j);
if (temp >= threshold)
strokeSum += temp;
}
}
}
printf("%d", strokeSum);
}
bfs:
#include<cstdio>
#include<queue>
using namespace std;
int rowNum, columnNum, depthNum, threshold;
using namespace std;
int slice[70][1300][130] = { 0 };
struct Position {
int depth, row, column;
Position(int d, int r, int c) {
depth = d;
row = r;
column = c;
}
};
int main() {
scanf("%d %d %d %d", &rowNum, &columnNum, &depthNum, &threshold);
for (int d = 1;d <= depthNum;d++) {
for (int i = 1;i <= rowNum;i++) {
for (int j = 1;j <= columnNum;j++) {
scanf("%d", &slice[d][i][j]);
}
}
}
int strokeSum = 0;
for (int d = 1;d <= depthNum;d++) {
for (int i = 1;i <= rowNum;i++) {
for (int j = 1;j <= columnNum;j++) {
if (slice[d][i][j] == 1) {
int strokeCount = 1;
queue<Position*> q;
slice[d][i][j] = 0;
q.push(new Position(d, i, j));
while (!q.empty()) {
Position *pos = q.front();
q.pop();
int d1 = pos->depth, r1 = pos->row, c1 = pos->column;
for (int m = -1; m <= 1;m++) {
for (int n = -1;n <= 1;n++) {
for (int l = -1;l <= 1;l++) {
if (l != 0 && (m != 0 || n != 0) || m != 0 && n != 0)
continue;
if (slice[d1 + l][r1 + m][c1 + n] == 1) {
slice[d1 + l][r1 + m][c1 + n] = 0;
strokeCount++;
q.push(new Position(d1 + l, r1 + m, c1 + n));
}
}
}
}
}
if (strokeCount >= threshold)
strokeSum += strokeCount;
}
}
}
}
printf("%d", strokeSum);
}