wuxiaowu547的博客

最近公共祖先离线算法Tarjan 一篇解释的很好的博客： http://www.cnblogs.com/JVxie/p/4854719.htmlpoj 1330 题目传送门：http://poj.org/problem?id=1330 模板代码：#include <stdio.h>#include <string.h>#include <iost...

题目传送门 思路： dis(s,k)+dis(k,t); 代码：#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<queue>#include&

模板：#include<cstdio>#include<iostream>#include<cstring>#include<cmath>#include<queue>#include<vector>#define inf 0x3f3f3f3fusing namespace std;int n, m;...

#include <iostream>#include <cstdio>#include <cstring>#include <queue>#define inf 0x3f3f3f3f3f3f3f3f#define ll long long#define MAXN 10005using namespace std;int n,m;//...

https://blog.csdn.net/yo_bc/article/details/72825629 晚上整理这两篇博客

【1】求给图着m个色的方案：#include<bits/stdc++.h>using namespace std;//判断k顶点与其所有相邻顶点的着色是否发生冲突bool OK(int k,int color[105],int graph[105][105]){ for (int i = 1; i < k; i++) { if (gra...

题目：poj2457我是题目#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<cmath>#include<queue&a

【1】有向图判环#include <iostream>#include <cstring>#include <cstdio>#include <algorithm>#include &am

#include <iostream>#include <cstring>#include <cstdio>#include <cstdlib>using namespace std;#define MAXN 10010#define MAXM 100010struct Edge{ int v, next;} edge[MA...