_rabbit的专栏

TreeTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 3189 Accepted: 897DescriptionYou are given a tree with N nodes. The tree’s nodes are numbered 1 thr

Euler CircuitTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu[Submit]   [Go Back]   [Status]  DescriptionProblem DEulerCircuitInput: stan

Getting in LineTime Limit:3000MS Memory Limit:Unknown 64bit IO Format:%lld & %llu[Submit]  [Go Back]  [Status]  Description Getting in Line Co

Ant TripTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1329    Accepted Submission(s): 514Problem DescriptionAnt Country consist of

Play on WordsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8839 Accepted: 3088DescriptionSome of the secret doors contain a very interesting word puzzle

Sightseeing tourTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7070 Accepted: 2941DescriptionThe city executive board in Lund wants to construct a sights

DescriptionYou are given a tree with N nodes.The tree nodes are numbered from1 to N.Each node has an integer weight.We will ask you to perform the following operation:u v k : ask for the k

由于这东西见得不多，先挖一个坑，以待日后补充。铁一份

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4085因为这题专门花一晚上学习斯坦纳树，找到比较好的学习资料,链接在这里：http://endlesscount.blog.163.com/blog/static/821197872012525113427573/花了很长时间照着别人写了一份自己风格的代码，慢慢理解：/* *******

Dig The WellsTime Limit: 6000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 971    Accepted Submission(s): 416Problem DescriptionYou may all know t

这篇文章讲解不错，挖一个坑：http://972169909-qq-com.iteye.com/blog/1185527

AircraftTime Limit: 10000/3000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 980    Accepted Submission(s): 228Problem DescriptionYou are playing a flyi

Paths on the treeTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 297    Accepted Submission(s): 93Problem Descriptionbobo has a tr

[BestCoder Round #5]冠军的奖励是小米3手机一部恭喜福州大学杨楠获得[BestCoder Round #4]冠军（iPad Mini一部）《BestCoder用户手册》下载Defence of the TreesTime Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/65536 K (Ja

HS BDCTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 792    Accepted Submission(s): 307Problem DescriptionIELTS is around the corne

DominoTime Limit:250MS Memory Limit:4096KB 64bit IO Format:%I64d & %I64u[Submit]  [Go Back]  [Status]  DescriptionDominoes – game played with small, rectangular b

John's tripTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6569 Accepted: 2182 Special JudgeDescriptionLittle Johnny has got a new car. He decided to

B - 双连通Time Limit:1000MS    Memory Limit:10000KB    64bit IO Format:%I64d & %I64uSubmitStatusDescriptionAccording to the Automobile Collision Monitor (ACM), most fatal traffic accident

一个无向连通网络，去掉一个边集可以使其变成两个连通分量则这个边集就是割集；最小割集当然就权和最小的割集。可以用最小切割最大流定理：1.min=MAXINT,确定一个源点2.枚举汇点3.计算最大流，并确定当前源汇的最小割集，若比min小更新min4.转到2直到枚举完毕5.min即为所求输出min不难看出复杂度很高：枚举汇点要O(n)，最短增广路最大流算法求最大流是O((n

Install Air ConditioningTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 768    Accepted Submission(s): 154Problem Description

Knights of the Round TableTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 8785 Accepted: 2813DescriptionBeing a knight is a very attractive career: search

Object ClusteringTime Limit: 2000MS Memory Limit: 131072KTotal Submissions: 1403 Accepted: 290DescriptionWe have N (N ≤ 10000) objects, and wish to classify them

D - Another Minimum Spanning TreeTime Limit:9000MS    Memory Limit:0KB    64bit IO Format:%lld & %lluSubmitStatusAppoint description:DescriptionFor a given point set P = {(xi,yi)

连通 OR 不连通Time Limit:1000MS  Memory Limit:65536KTotal Submit:51 Accepted:9Description给定一个无向图，一共n个点，请编写一个程序实现三种操作：E x 从原图中删除连接x节点的所有边。D x y 从原图中删除连接x，y节点的边。Q x y 询问x，y节点是否连通。Input输入只有一

Gymman vs FilaTime Limit:2000MS Memory Limit:Unknown 64bit IO Format:%lld & %llu[Submit]  [Go Back]  [Status]  Description  Gymman vs Fila The

Greatest TCTime Limit: 12000/4000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 509    Accepted Submission(s): 148Problem DescriptionTC (Tian Chao) is m

CatenymsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8857 Accepted: 2336DescriptionA catenym is a pair of words separated by a period such that the las

Task SequencesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2062 Accepted: 583 Special JudgeDescriptionTom has received a lot of tasks from his boss

Graph ColoringTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3830 Accepted: 1711 Special JudgeDescriptionYou are to write a program that tries to fin

HDU 5102 树分治