![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
图论
BryantMark
这个作者很懒,什么都没留下…
展开
-
HDU 4612
"trajin algorithm" then bfs to determine the longest the distance between any two edge biconnected components #pragma comment(linker,"/STACK:102400000,102400000") #include #include #include #includ原创 2013-07-27 04:06:57 · 565 阅读 · 0 评论 -
HDU 4606
根据线段相交 建图 求最短路 二分答案 求最小路径覆盖 #include #include #include const int maxn = 311; const double eps = 1e-8; const double INF = 1e50; #define zero(x) (((x)>0?(x):-(x))<eps) template T min(const T& a, co原创 2013-07-29 01:09:09 · 489 阅读 · 0 评论