随笔档案「2015年8月8日」：连通性2 无向图的割边 (cut edge) ... - Pat

2015年8月8日

摘要：这是DFS系列的第二篇割边的概念 In graph theory, a bridge, isthmus, cut-edge, or cut arc is an edge of a graph whose deletion increases its number of connected comp 阅读全文

posted @ 2015-08-08 16:53 Pat 阅读(5030) 评论(0) 推荐(0)

Codeforces 548B Mike and Fun

摘要：传送门 B. Mike and Fun time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Mike and some bears 阅读全文

posted @ 2015-08-08 03:12 Pat 阅读(256) 评论(0) 推荐(0)

Pat

「以解决问题为乐」

真的喜欢么？真的喜欢就去做吧。

Lost Boy Calling 。。。。

... Many of these issues are best dealt with at the algorithmic level, rather than by "tweaking" the code.

This is an obscurity that catches the unwary.

原来我什么都不懂。

公告

Pat

「以解决问题为乐」 真的喜欢么？真的喜欢就去做吧。 Lost Boy Calling 。。。。 ... Many of these issues are best dealt with at the algorithmic level, rather than by "tweaking" the code. This is an obscurity that catches the unwary. 原来我什么都不懂。

公告

「以解决问题为乐」

真的喜欢么？真的喜欢就去做吧。

Lost Boy Calling 。。。。

... Many of these issues are best dealt with at the algorithmic level, rather than by "tweaking" the code.

This is an obscurity that catches the unwary.

原来我什么都不懂。