POJ2375 Cow Ski Area （强连通）（缩点）

                                    Cow Ski Area

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 3323		Accepted: 919

Description

Farmer John's cousin, Farmer Ron, who lives in the mountains of Colorado, has recently taught his cows to ski. Unfortunately, his cows are somewhat timid and are afraid to ski among crowds of people at the local resorts, so FR has decided to construct his own private ski area behind his farm.

FR's ski area is a rectangle of width W and length L of 'land
squares' (1 <= W <= 500; 1 <= L <= 500). Each land square
is an integral height H above sea level (0 <= H <= 9,999). Cows
can ski horizontally and vertically between any two adjacent land
squares, but never diagonally. Cows can ski from a higher square to a
lower square but not the other way and they can ski either direction
between two adjacent squares of the same height.

FR wants to build his ski area so that his cows can travel between
any two squares by a combination of skiing (as described above) and ski
lifts. A ski lift can be built between any two squares of the ski area,
regardless of height. Ski lifts are bidirectional. Ski lifts can cross
over each other since they can be built at varying heights above the
ground, and multiple ski lifts can begin or end at the same square.
Since ski lifts are expensive to build, FR wants to minimize the number
of ski lifts he has to build to allow his cows to travel between all
squares of his ski area.

Find the minimum number of ski lifts required to ensure the cows can
travel from any square to any other square via a combination of skiing
and lifts.

Input

* Line 1: Two space-separated integers: W and L

* Lines 2..L+1: L lines, each with W space-separated integers corresponding to the height of each square of land.

Output

*
Line 1: A single integer equal to the minimal number of ski lifts FR
needs to build to ensure that his cows can travel from any square to any
other square via a combination of skiing and ski lifts

Sample Input

9 3
1 1 1 2 2 2 1 1 1
1 2 1 2 3 2 1 2 1
1 1 1 2 2 2 1 1 1

Sample Output

3
SB题，还花了好长时间，不开心，不写题解了。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <time.h>
#include <string>
#include <map>
#include <stack>
#include <vector>
#include <set>
#include <queue>
#define inf 0x3f3f3f3f
#define mod 10000
typedef long long ll;
using namespace std;
const int N=;
const int M=;
int s,t,n,m,cnt,tim,top,cut,k;
int head[M],dfn[M],low[M],stack1[M];
int num[M],in[M],out[M],vis[M],w[N][N];
int dis[][]= {,,,,-,,,-};
bool flag=false;
struct man {
    int to,nxt;
} edg[M*];
void addedg(int u,int v) {
    edg[cnt].to=v;
    edg[cnt].nxt=head[u];
    head[u]=cnt++;//printf("!!!%d %d\n",u,v);system("pause");
}
void init() {
    cnt=;
    tim=;
    top=cut=k=;
    memset(head,-,sizeof head);
    memset(dfn,,sizeof dfn);
    memset(low,,sizeof low);
    memset(stack1,,sizeof stack1);
    memset(num,,sizeof num);
    memset(in,,sizeof in);
    memset(out,,sizeof out);
    memset(vis,,sizeof vis);
    memset(edg,,sizeof edg);
    memset(w,,sizeof w);
}
void Tarjan(int u) {
    int v;
    low[u] = dfn[u] = ++tim;
    stack1[top++] = u;
    vis[u] = ;
    for(int e = head[u]; e != -; e = edg[e].nxt)
    {
        v = edg[e].to;
        if(!dfn[v])
        {
            Tarjan(v);
            low[u] = min(low[u], low[v]);
        }
        else if(vis[v])
        {
            low[u] = min(low[u], dfn[v]);
        }
    }
    if(low[u] == dfn[u])
    {
        cut++;
        do
        {
            v = stack1[--top];
            num[v] = cut;
            vis[v] = ;
        }while(u != v);
    }
}
void build(int i,int j,int d)
{
    int xx=i+dis[d][];
    int yy=j+dis[d][];
    int u=i*m+j,v=xx*m+yy;
    if(xx>=&&yy<m&&yy>=&&xx<n){
        if(w[i][j]>=w[xx][yy])addedg(u,v);
        if(w[i][j]<=w[xx][yy])addedg(v,u);
    }
    return;
}
int main() {
    while(~scanf("%d%d",&m,&n)) {
        init();
        for(int i=; i<n; i++) {
            for(int j=; j<m; j++) {
                scanf("%d",&w[i][j]);
            }
        }
        for(int i = ; i < n; i++) {
            for(int j = ; j < m; j++) {
                for(int d = ; d < ; d++) {
                    build(i,j,d);
                }
            }
        }
        for(int i=; i<n*m; i++)if(!dfn[i])Tarjan(i);
        for(int i=; i<n*m; i++) {
            for(int j=head[i]; j!=-; j=edg[j].nxt) {
                int v=edg[j].to;
                if(num[i]!=num[v])out[num[i]]++,in[num[v]]++;
            }
        }
        int father=,son=;
        for(int i=; i<=cut; i++) {
            if(in[i]==)father++;
            if(out[i]==)son++;
        }
        if(cut==)printf("0\n");
        else printf("%d\n",max(father,son));
    }
    return ;
}