王小二的博客

RewardTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9199    Accepted Submission(s): 2937Problem DescriptionDandelion's uncle i

我们首先来看一下什么是前向星.前向星是一种特殊的边集数组,我们把边集数组中的每一条边按照起点从小到大排序,如果起点相同就按照终点从小到大排序,并记录下以某个点为起点的所有边在数组中的起始位置和存储长度,那么前向星就构造好了.用len[i]来记录所有以i为起点的边在数组中的存储长度.用head[i]记录以i为边集在数组中的第一个存储位置.

Roads in the NorthTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2933 Accepted: 1442DescriptionBuilding and maintaining roads among communities in th

点击打开题目 1094 - Farthest Nodes in a Tree PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB Given a tree (a connected graph with no cycles), you have to find the farthe

点击打开题目1094 - Farthest Nodes in a Tree   PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBGiven a tree (a connected graph

The Bottom of a Graph Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 11623 Accepted: 4784 DescriptionWe will use the following (standard) definitions from graph theory. Le...