- 博客(9)
- 资源 (1)
- 收藏
- 关注
原创 递推式的矩阵优化
基础链接:http://blog.csdn.net/flyfish1986/article/details/48014523可以看一下uva10870 等我有空的时候把我推导过程传上来
2017-11-22 12:40:04 276 2
原创 tarjan 离线 lca hdu2586
lca的离线操作:这篇博客写的很好 https://www.cnblogs.com/JVxie/p/4854719.html。。我实现的代码#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn=80010;struct node{
2017-11-08 21:27:00 219
原创 [kuangbin带你飞]专题九 连通图 Critical Links UVA - 796
In a computer network a link L, which interconnects two servers, is considered critical if there are at least two servers A and B such that all network interconnection paths between A and B pass throu
2017-11-07 22:33:28 316
原创 [kuangbin带你飞]专题九 连通图 Strongly connected HDU - 4635
Give a simple directed graph with N nodes and M edges. Please tell me the maximum number of the edges you can add that the graph is still a simple directed graph. Also, after you add these edges, this
2017-11-07 11:29:21 231
原创 [kuangbin带你飞]专题九 连通图 F - Warm up HDU - 4612 缩点+树的直径
N planets are connected by M bidirectional channels that allow instant transportation. It’s always possible to travel between any two planets through these channels. If we can isolate some planets
2017-11-07 09:21:01 343
原创 [kuangbin带你飞]专题九 连通图 E - Redundant Paths POJ - 3177
In order to get from one of the F (1 <= F <= 5,000) grazing fields (which are numbered 1..F) to another field, Bessie and the rest of the herd are forced to cross near the Tree of Rotten Apples. The co
2017-11-07 09:16:34 254
原创 [kuangbin带你飞]专题九 连通图 求桥(有坑点)
I - Caocao’s Bridges Caocao was defeated by Zhuge Liang and Zhou Yu in the battle of Chibi. But he wouldn’t give up. Caocao’s army still was not good at water battles, so he came up with another idea.
2017-11-03 20:27:22 253
原创 [kuangbin带你飞]专题九 连通图 求割点裸题
B - Network UVA - 315 A Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several places numbered by integers from 1 to N. No two places have the same n
2017-11-03 19:39:47 268
原创 [kuangbin带你飞]专题九 连通图 ——tarjan算法+缩点
Network of Schools POJ - 1236 A number of schools are connected to a computer network. Agreements have been developed among those schools: each school maintains a list of schools to which it distrib
2017-11-03 19:11:32 293
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人