POJ2375 Cow Ski Area 强连通分量

题意：给定一个n*m矩阵，每一个点都有一个高度，规定只能由高处向低处走，现在某些地方加电梯，使得低处能向高处走，问最少加几个电梯，使得任意两个点之间可以相互到达。即整个图是强连通的。

用g++交题re，c++交能过

#include<cstdio>
#include<cstring>
using namespace std;
const int maxn = 520;
int scc[maxn][maxn],map[maxn][maxn];
int out_[maxn*maxn],in_[maxn*maxn];
int n,m,num;
int dfs(int i,int j)//计算每个点所在连通分量编号 
{
	if(scc[i][j])return scc[i][j];
	scc[i][j]=num;
	if(i+1<=n  && map[i][j]==map[i+1][j])dfs(i+1,j);
	if(i-1>=0 && map[i][j]==map[i-1][j])dfs(i-1,j);
	if(j+1<=m  && map[i][j]==map[i][j+1])dfs(i,j+1);
	if(j-1>=0 && map[i][j]==map[i][j-1])dfs(i,j-1);
}
int main()
{
	scanf("%d%d",&m,&n);
	
	for(int i=1;i<=n;i++)
	for(int j=1;j<=m;j++)
	scanf("%d",&map[i][j]);
	
	num=0;
	for(int i=1;i<=n;i++)
	for(int j=1;j<=m;j++)
	if(!scc[i][j])
	{
		num++;
		dfs(i,j);
	}
	for(int i=1;i<=n;i++)
	for(int j=1;j<=m;j++)
	{
		if(i+1<=n&&map[i][j]>map[i+1][j])
			out_[scc[i][j]]=in_[scc[i+1][j]]=1;
		else if(i+1<=n&&map[i][j]<map[i+1][j])
			in_[scc[i][j]]=out_[scc[i+1][j]]=1;
		
		if(j+1<=m&&map[i][j]>map[i][j+1])
			out_[scc[i][j]]=in_[scc[i][j+1]]=1;
		else if(j+1<=m&&map[i][j]<map[i][j+1])
			in_[scc[i][j]]=out_[scc[i][j+1]]=1;
	}
	int suma,sumb;
	suma=sumb=0;
	if(num!=1)
	for(int i=1;i<=num;i++)
	{
		if(in_[i]==0)suma++;
		if(out_[i]==0)sumb++;
	}
	
	printf("%d",suma>sumb?suma:sumb);
}