递归一下完事,注意炸弹的引爆规则就行,左边K个,上边所有,有炸弹就会引爆,然后连环爆炸
#include<stdio.h>
static int n, m, room[1000][1000];
static void explode(int row, int col)
{
if (!room[row][col])
return;
int i, j, k = room[row][col];
room[row][col] = 0;
for (j = col - 1; j >= col - k && j >= 0; j--)
explode(row, j);
for (i = row - 1; i >= 0; i--)
explode(i, col);
}
int main()
{
while (scanf("%d %d", &n, &m) != EOF)
{
int i, j;
for (i = 0; i < n; i++)
for (j = 0; j < m; j++)
scanf("%d", &room[i][j]);
int total = 0;
for (i = n - 1; i >= 0; i--)
for (j = m - 1; j >= 0; j--)
if (room[i][j])
{
explode(i, j);
total++;
}
printf("%d\n", total);
}
return 0;
}
版权声明:本文为xhldtc原创文章,遵循 CC 4.0 BY-SA 版权协议,转载请附上原文出处链接和本声明。