几道强连通分量模板题（hdu 1269 &）

裸的模板题
把模板分析一下吧，嗯~ o(￣▽￣)o
hdu 1269 迷宫城堡

#include
#include
#include
#include
#include
#include
#include
using namespace std;
#define INF 0xffffff
#define MAX 10005
int top;
int Stack[MAX];
bool Instack[MAX];
int DFN[MAX], LOW[MAX];
int Belong;
int Bcnt, Dindex;
vector< vector > G;
int n,m;

void Tarjan(int u)
{
    LOW[u] = DFN[u] = ++Dindex;
    Stack[top++] = u;
    Instack[u] = true;
    int len = G[u].size(),v;
    
    for(int i=0;i

HDU - 1827

#include
#include
#include
#include
#include
#include
#include
using namespace std;
const int maxn = 1005;
const int inf = 0xffffff;
int low[maxn],dfn[maxn];
bool vis[maxn];
int cost[maxn];
int tcost[maxn];
int belong[maxn];
int in[maxn],out[maxn];
vector G[maxn];
stacks;
int n,m;
int index,cnt;

void init()
{
    cnt = index = 0;
    for(int i=0;i<=n;i++)
    {
        G[i].clear();
        cost[i] = low[i] = dfn[i] = vis[i] = 0;
        belong[i] = in[i] = out[i] = 0;
        tcost[i] = inf;
    }
}

void Tarjan(int u)
{
    low[u] = dfn[u] = ++index;
    vis[u] = true;
    s.push(u);
    for(int i=0;i

HDU - 3072