Description
Problem H
Halum
Time Limit : 3 seconds
You are given a directed graph G(V,E) with a set of vertices and edges. Each edge (i,j) that connects some ...
分类：
其他好文 时间：
2014-07-22 00:08:34
阅读次数：
307
题目如下：
Problem D
Fill
There are three jugs with a volume of a, b and c liters. (a,b, and c are positive integers not greater than 200). The first and the secondjug are initially empty, wh...
分类：
其他好文 时间：
2014-07-21 11:32:15
阅读次数：
253
本文出自：http://blog.csdn.net/svitter
分析：vector是STL模板中的容器。可以利用其性质来构建邻接表。
定义：
#include
#define MAXN 10000
//max n of a tree or graph
//if is a tree, n / 2 is OK ;
using namespace std;
typedef ve...
分类：
其他好文 时间：
2014-07-21 11:27:55
阅读次数：
228
The Unique MSTTime Limit:1000MSMemory Limit:10000KTotal Submissions:19847Accepted:6959DescriptionGiven a connected undirected graph, tell if its minim...
分类：
其他好文 时间：
2014-07-21 00:23:08
阅读次数：
303
Basic Knowledge of Python
分类：
编程语言 时间：
2014-07-19 16:20:01
阅读次数：
254
Clone an undirected graph. Each node in the graph contains alabeland a list of itsneighbors.OJ's undirected graph serialization:Nodes are labeled uniq...
分类：
其他好文 时间：
2014-07-19 12:11:53
阅读次数：
238
题目如下：
Graph Coloring
You are to write a program that tries to find an optimal coloring for agiven graph. Colors are applied to the nodes of the graph and the only availablec...
分类：
其他好文 时间：
2014-07-19 02:35:06
阅读次数：
210
题目如下：
Bandwidth
Given a graph (V,E) where V is a set of nodes and E is a set of arcsin VxV, and an
ordering on the elements in V, then the bandwidth of a node
v is defined as...
分类：
其他好文 时间：
2014-07-19 02:26:15
阅读次数：
206
Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.OJ's undirected graph serialization:Nodes are labeled u...
分类：
其他好文 时间：
2014-07-19 00:05:00
阅读次数：
201
今天执行脚本的时候遇到错误，如下图：root@ApFree:/usr/sbin# ./conntrack_num_graph.sh ./conntrack_num_graph.sh: line 9: syntax error: unexpected "then" (expecting "}")roo...
分类：
其他好文 时间：
2014-07-18 12:04:31
阅读次数：
554
