pat 1034. Head of a Gang (30)

DFS尋找連通份量ios #include<stdio.h> #include<iostream> #include<string> #include<vector> #include<map> #include<algorithm> #define SIZE 2000 #define INF 0x7fffffff using namespace std; int graph[SIZE][SIZ

>>阅读原文<<