百炼城堡问题-栈的解法

根据ppt的提示，我这个菜鸟又一步一步完成了栈的解法

/*
* Filename:    1.cpp
* Desciption:  Desciption
* Created:     2016-03-10
* Author:    	yunlong Wang  
 [mail:17744454343@163.com]
*
*/
#include <stack>
#include <cmath>
#include <bitset>
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cstring>
#define INT_MAX 1<<30
using namespace std;
typedef long long ll;
const int INF=0x7F;

int room[60][60];
int color[60][60];
int roomnum = 0;
int roomcontent;
int Maxcontent = 0;

void dfs(int ii,int jj)
{
	/*if(color[i][j])
		return ;
	roomcontent++;
	color[i][j] = roomnum;
	if ((room[i][j] & 1) == 0)	dfs(i,j-1);
	if ((room[i][j] & 4) == 0)	dfs(i,j+1);
	if ((room[i][j] & 2) == 0)	dfs(i-1,j);
	if ((room[i][j] & 8) == 0)	dfs(i+1,j);
	if(roomcontent > Maxcontent)
		Maxcontent = roomcontent;*/
		struct ans
	{
		int a,b;
		ans(int aa,int bb):a(aa),b(bb){}
	};
	stack <ans> answer;
	answer.push(ans(ii,jj));
	while (!answer.empty())
	{
		ans stk = answer.top();
		int i = stk.a;
		int j = stk.b;
		if(color[i][j])
		{
			answer.pop();
		}
		else
		{
			roomcontent++;//注意没有访问过的才+1
			color[i][j] = roomnum;
			if ((room[i][j] & 1) == 0)	dfs(i,j-1);
			if ((room[i][j] & 4) == 0)	dfs(i,j+1);
			if ((room[i][j] & 2) == 0)	dfs(i-1,j);
			if ((room[i][j] & 8) == 0)	dfs(i+1,j);
		}
	}
}

int main()
{
	int m,n;
	cin >> m >> n;
	memset(color,0,sizeof(color));
	for ( int i = 0; i < m; i += 1)
	{
		for ( int j = 0; j < n; j += 1)
		{
			cin >> room[i][j];
		}
	}
	for ( int i = 0; i < m; i += 1)
	{
		for ( int j = 0; j < n; j += 1)
		{
			if (!color[i][j])
			{
				roomnum++;
				roomcontent = 0;
				dfs(i,j);
				Maxcontent = max(Maxcontent,roomcontent);
			}
		}
	}
	cout << roomnum << endl ;
	cout << Maxcontent << endl;
	return 0;
}

容我自己完成栈的使用后再来更新