Ural 1416 Confidential

题意:给你N个点,以及M条边,让你计算是否存在最小生成树和次小生成树,如果存在打印出权值,否则打印-1. 代码:#include #include #include #include #include #include #include using namespace std; c...

2018-01-27 20:49:42

阅读数 67

评论数 0

uva10600ACM Contest and Blackout

题目:n个点,m条边,求最小生成树的值和次小生成树的值。 代码:#include #include #include #include #include #include #include using namespace std; const int inf=0x3f3f3f3f;...

2018-01-27 20:47:35

阅读数 53

评论数 0

poj1679The Unique MST

The Unique MST Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 33247   Accepted: 12102 Description Given...

2018-01-27 20:45:34

阅读数 40

评论数 0

poj2831Can We Build This One?

Can We Build This One? Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 1857   Accepted: 681 Case Time Limit: 2000...

2018-01-27 20:42:55

阅读数 61

评论数 0

hdu4081

Qin Shi Huang's National Road System Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 9305 ...

2018-01-27 20:39:13

阅读数 108

评论数 0

UVa 10462 Is There A Second Way Left?

Is There A Second Way Left ? Input: standard input Output: standard output Time Limit: 3 seconds   Nasa, being the most talented progr...

2018-01-27 20:32:18

阅读数 67

评论数 0

提示
确定要删除当前文章?
取消 删除