Given a connected undirected graph, tell if its minimum spanning tree is unique.
Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of G is a subgraph of G, say T = (V', E'), with the following properties:
1...
分类：
其他好文 时间：
2015-02-23 15:33:46
阅读次数：
257
Problem Description
There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and only if there is a road between A and B, or t...
分类：
编程语言 时间：
2015-02-23 15:31:07
阅读次数：
231
As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the l...
分类：
其他好文 时间：
2015-02-23 14:19:34
阅读次数：
165
In a typical assembly line, machines are connected one by one. The first machine's output product will be the second machine's raw material. To simpli...
分类：
系统相关 时间：
2015-02-22 15:45:36
阅读次数：
240
本文是原创文章，转载请注明出处：
做一个 INITIAL EXTENT 大于 UNIFORM size 乘以 MINEXTENTS 的实验。总结出initial extent的分配规律
Connected to:
Oracle Database 11g Enterprise Edition Release 11.2.0.4.0 - 64bit Production
With the Parti...
分类：
其他好文 时间：
2015-02-15 19:27:41
阅读次数：
195
The Unique MSTTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 21706Accepted: 7676DescriptionGiven a connected undirected graph, tell if its m...
分类：
其他好文 时间：
2015-02-14 13:44:24
阅读次数：
164
For a given undirected graph with N vertices and E edges, please list all the connected components by both DFS and BFS. Assume that all the vertices a...
分类：
其他好文 时间：
2015-02-12 20:08:39
阅读次数：
145
Time Limit: 1000 mSec Memory Limit : 32768 KB
Problem Description
Year 2900. Many people left Earth and built some cities on Mars.
Currently there are N cities, some of which are connected b...
分类：
其他好文 时间：
2015-02-11 16:48:03
阅读次数：
168
查看实例编号，名称和日志模式：SYSASSYSDBA@ORCL>selectdbid,name,log_modefromv$database;DBIDNAMELOG_MODE-------------------------------1391294860ORCLARCHIVELOG1rowselected.RMAN:登录：[oracle@oracle~]$rmanRMAN>CONNECTTARGET///连接本地数据库connectedtotar..
分类：
数据库 时间：
2015-02-08 23:27:50
阅读次数：
518
传送门：Strongly connected题意：求最多可以加多少边，使得最新的图还不是强连通图。分析：最终添加完边的图，肯定可以分成两个部X和Y，其中只有X到Y的边没有Y到X的边，那么要使得边数尽可能的多，则X部肯定是一个完全图，Y部也是，同时X部中每个点到Y部的每个点都有一条边，但Y没有可以到达...
分类：
其他好文 时间：
2015-02-08 20:34:41
阅读次数：
200
