并查集
J1nAB1n9
困困倦倦,浑浑噩噩
展开
-
HDU 1213 How Many Tables [并查集]
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Problem DescriptionToday is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to原创 2017-10-14 18:18:40 · 258 阅读 · 0 评论 -
UVA - 1395 Slim Span (最小生成树)
点击打开链接原题链接-------------------------------这道题目的要求很有趣, 不是单纯的找最小生成树,而是求最苗条的生成树,即最大边权减去最小边权的值尽量的小。由于题的数据量不大可以直接暴力,即在排序之后枚举每一个边作为最短边,然后枚举剩下的所有的边为最大边。没有连通的节点并入,已经连通的节点跳过。所有也不是特别难AC的题目。#include <iostream&...原创 2018-02-10 03:26:00 · 256 阅读 · 0 评论 -
HDU - 1856 More is better (基础并查集)
More is betterhttps://vjudge.net/problem/11137/origin题目描述Mr Wang wants some boys to help him with a project. Because the project is rather complex, the more boys come, the better it will be....原创 2018-05-25 15:35:51 · 382 阅读 · 1 评论 -
HDU - 1102 Constructing Roads (最小生成树)
Constructing Roads原题链接:http://acm.hdu.edu.cn/showproblem.php?pid=1102There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connec...原创 2018-05-25 16:55:31 · 273 阅读 · 0 评论 -
HDU - 3371 Connect the Cities
HDU - 3371 Connect the Cities原题链接到HDU:http://acm.hdu.edu.cn/showproblem.php?pid=3371Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2412...原创 2018-06-04 20:03:38 · 281 阅读 · 0 评论 -
HDU-1598 find the most comfortable road(枚举最小生成树)
HDU-1598 find the most comfortable road(枚举最小生成树)原题链接:HDU-1598XX星有许多城市,城市之间通过一种奇怪的高速公路SARS(Super Air Roam Structure—超级空中漫游结构)进行交流,每条SARS都对行驶在上面的Flycar限制了固定的Speed,同时XX星人对 Flycar的“舒适度”有特殊要求,即乘坐过程中最...原创 2018-06-18 18:13:55 · 240 阅读 · 0 评论 -
HDU - 1811 Rank of Tetris(并查集+拓扑排序)
Rank of Tetris HDU - 1811 自从Lele开发了Rating系统,他的Tetris事业更是如虎添翼,不久他遍把这个游戏推向了全球。为了更好的符合那些爱好者的喜好,Lele又想了一个新点子:他将制作一个全球Tetris高手排行榜,定时更新,名堂要比福布斯富豪榜还响。关于如何排名,这个不用说都知道是根据Rating从高到低来排,如果两个人具有相同的Rating,那就按这几...原创 2018-07-09 23:26:33 · 193 阅读 · 0 评论 -
hdu-1558 Segment set(几何计算+并查集)
hdu-1558 Segment set原题链接Problem DescriptionA segment and all segments which are connected with it compose a segment set. The size of a segment set is the number of segments in it. The problem is...原创 2018-07-31 16:48:29 · 303 阅读 · 0 评论