摘要：
poj 1330 http://poj.org/problem?id=1330最基础的了吧代码：#include<iostream>#include<cstdio>#include<string>#include<cstring>#define nMAX 10005using namespace std;int head[nMAX],parent[nMAX];bool vs[nMAX],use[nMAX],fg;int s_edge,n,start,end;struct Edge{ int v,nxt;}edge[nMAX];void added 阅读全文
