并查集
dxyinme
这个作者很懒,什么都没留下…
展开
-
[UESTC1636]梦后楼台高锁,酒醒帘幕低垂
给你一个有n个点和m条边的无向连通图,每条边都有一个权值w.我们定义,对于一条路径,它的Charm value为该路径上所有边的权值的最大值与最小值的差.询问从1到n的所有路径的Charm value的最小值.输入 第一行,有两个整数n,m(1≤n≤200,n−1≤m≤1000),表示该图有n个点和m条边. 接下来m行,每行三个整数u,v,w(1≤u,v≤n,1≤w≤1000000),表原创 2017-07-15 15:41:44 · 372 阅读 · 0 评论 -
[vijos 1776]关押罪犯
P.S. : 渐渐学会用markdown的DXY ==、描述S城现有两座监狱,一共关押着N名罪犯,编号分别为1~N。他们之间的关系自然也极不和谐。很多罪犯之间甚至积怨已久,如果客观条件具备则随时可能爆发冲突。我们用“怨气值”(一个正整数值)来表示某两名罪犯之间的仇恨程度,怨气值越大,则这两名罪犯之间的积怨越多。如果两名怨气值为c的罪犯被关押在同一监狱,他们俩之间会发生摩擦,并造成影响力为c的冲突事原创 2017-08-11 15:23:32 · 178 阅读 · 0 评论 -
[POJ1703]Find them, Catch them
Time Limit: 1000MS Memory Limit: 10000K Description The police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang S...原创 2018-03-31 22:36:26 · 129 阅读 · 0 评论 -
AtCoder Regular Contest 097
因为太菜了所以只有前两题>_< C. 题意:给定一个|S|<=5000|S|<=5000|S|SSS,求它的所有子串(不重复)中第k小的(k<=5)(k<=5)(kSSS的所有长度小于等于5的子串然后排序取第k个就好了,时间复杂度也不大OwO #include&am原创 2018-05-13 00:07:16 · 171 阅读 · 0 评论 -
[codeforces1139C]Edgy Trees
time limit per test : 2 seconds memory limit per test : 256 megabytes You are given a tree (a connected undirected graph without cycles) of nnn vertices. Each of the n−1n−1n−1 edges of the tree is col...原创 2019-04-05 11:45:30 · 290 阅读 · 0 评论 -
[HDU2969]Skyscrapers
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description In a seaside village, there is an avenue of skyscrapers. Each skyscrapers is 100m wide and has cer...原创 2019-03-28 16:17:38 · 259 阅读 · 0 评论 -
[codeforces1095F]Make It Connected
time limit per test : 2 seconds memory limit per test : 256 megabytes You are given an undirected graph consisting of nnn vertices. A number is written on each vertex; the number on vertex iii is aia_...原创 2019-06-08 10:59:35 · 322 阅读 · 0 评论