cqwelly的专栏

/*Source CodeProblem: 1001Username: 2010201211Run Time: 304MSMemory: 1208KLanguage:C++JudgeStatus: AcceptedAuthor:MarkLiu*/#include #include #include #include #include using namespace s

//2375#include #include #include #include #include #define N 510using namespace std;struct Node{ int v,next;}e[N*N*4];int head[N*N],e_num,num,od[N*N],id[N*N];int map[N][N],temp_map[N][

//poj1144#include #include #include #include #include #define M 100100#define N 1100using namespace std;struct Node{ int v,next;}e[M];int head[N],e_num,n;int low[N],dfn[N],stack[N],d

// hdu 4280#include #define MAXV 100010#define MAXE 400010#define INF 0x7fffffff;struct Node{ int u, v, next; int cap;}edge[MAXE];int head[MAXV],en;void add_edge(int u, int v, int c

#include #include #include #include #define N 510using namespace std;struct Node{ int v; int next;}edge[N*N];int head[N];void add_edge( int u, int v, int &i ){ edge[i].v = v;

#include #include #include #include #include #define M 2000020#define N 550#define FOR(i,n) for(int i=0;i<n;i++)#define INF 0x7fffffffusing namespace std;struct Node{ int cost; i

#include #include #include #include #include #include #define MAXN 210#define MAXE 30010#define FOR(i_,a,b) for( int i_ = a; i_ <= b; i_ ++ )#define INF 0x7ffffffusing namespace std;struct

#include #include #include #include #define N 88404using namespace std;struct Node{ int v,next;}edge[N];int head[N], m, pre[N];bool mark[N];void add_edge( int u, int v, int &num ){

#include #include #include #include #define N 10010using namespace std;struct Point{ int x,y;}Q[N];struct Node{ int v,next;}edge[N*10];int pre[N], head[N], TN[33][33],tm[33][33];

//1236#include #include #include #include #define N 110using namespace std;bool map[N][N];int s[N],s_n,low[N],stack[N],top,n,p[N];void dfs( int u, int dfs_num, int &scc_num){ low[u]=++dfs

#include #include #include #define N 1010#define M 6060using namespace std;struct Node{ int v,next;}edge[M], edge2[M];int head[N], head2[N], SCC, num, top;int low[N], dfn[N], sta[N], sn[

差分约束学习资料算法导论hdu 3666 http://acm.hdu.edu.cn/showproblem.php?pid=3666题目要求对 L详细点击打开链强联通分量学习资料https://www.byvoid.com/blog/scc-tarjan poj 1236 http://poj.org/problem?id=1236基础