![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
图论
shine碎
这个作者很懒,什么都没留下…
展开
-
Oil Skimming
Thanks to a certain "green" resources company, there is a new profitable industry of oil skimming. There are large slicks of crude oil floating in the Gulf of Mexico just waiting to be scooped up by ...原创 2019-02-06 10:54:07 · 243 阅读 · 0 评论 -
Taxi Cab Scheme(最小路径覆盖)
Running a taxi station is not all that simple. Apart from the obvious demand for a centralised coordination of the cabs in order to pick up the customers calling to get a cab as soon as possible, the...原创 2019-02-06 11:53:11 · 180 阅读 · 0 评论 -
棋盘游戏
小希和Gardon在玩一个游戏:对一个N*M的棋盘,在格子里放尽量多的一些国际象棋里面的“车”,并且使得他们不能互相攻击,这当然很简单,但是Gardon限制了只有某些格子才可以放,小希还是很轻松的解决了这个问题(见下图)注意不能放车的地方不影响车的互相攻击。所以现在Gardon想让小希来解决一个更难的问题,在保证尽量多的“车”的前提下,棋盘里有些格子是可以避开的,也就是说,不在这些格子上放车,...原创 2019-02-06 13:27:40 · 661 阅读 · 0 评论 -
hdu2767 Proving Equivalences(强连通tarjan+缩点)
Problem DescriptionConsider the following exercise, found in a generic linear algebra textbook.Let A be an n × n matrix. Prove that the following statements are equivalent:A is invertible.Ax = b ...原创 2019-02-27 21:25:15 · 124 阅读 · 0 评论 -
迷宫城堡hdu1269(强连通tarjan)
为了训练小希的方向感,Gardon建立了一座大城堡,里面有N个房间(N<=10000)和M条通道(M<=100000),每个通道都是单向的,就是说若称某通道连通了A房间和B房间,只说明可以通过这个通道由A房间到达B房间,但并不说明通过它可以由B房间到达A房间。Gardon需要请你写个程序确认一下是否任意两个房间都是相互连通的,即:对于任意的i和j,至少存在一条路径可以从房间i到房间j,...原创 2019-02-28 14:40:47 · 114 阅读 · 0 评论 -
poj3160 Father Christmas flymouse(强连通图+dijkstra)
DescriptionAfter retirement as contestant from WHU ACM Team, flymouse volunteered to do the odds and ends such as cleaning out the computer lab for training as extension of his contribution to the te...原创 2019-02-28 16:42:52 · 171 阅读 · 0 评论