随笔分类 -  数据结构 并查集

1 2 下一页
Codeforces Round #616 (Div. 2) E. Prefix Enlightenment 图论
摘要：E. Prefix Enlightenment time limit per test3 seconds memory limit per test256 megabytes There are n lamps on a line, numbered from 1 to n. Each one ha 阅读全文
posted @ 2020-02-03 19:37 qscqesze 阅读(653) 评论(0) 推荐(3) 编辑
Codeforces Round #603 (Div. 2) D. Secret Passwords 并查集
摘要：D. Secret Passwords One unknown hacker wants to get the admin's password of AtForces testing system, to get problems from the next contest. To achieve 阅读全文
posted @ 2019-11-30 11:33 qscqesze 阅读(561) 评论(0) 推荐(0) 编辑
Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals) C. String Reconstruction 并查集
摘要：C. String Reconstruction 题目连接： http://codeforces.com/contest/828/problem/C Description Ivan had string s consisting of small English letters. However, 阅读全文
posted @ 2017-07-16 11:02 qscqesze 阅读(378) 评论(0) 推荐(0) 编辑
Codeforces Round #396 (Div. 2) D. Mahmoud and a Dictionary 并查集
摘要：D. Mahmoud and a Dictionary 题目连接： http://codeforces.com/contest/766/problem/D Description Mahmoud wants to write a new dictionary that contains n word 阅读全文
posted @ 2017-02-08 15:21 qscqesze 阅读(495) 评论(0) 推荐(0) 编辑
Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) C. Destroying Array 带权并查集
摘要：C. Destroying Array 题目连接： http://codeforces.com/contest/722/problem/C Description You are given an array consisting of n non negative integers a1, a2, 阅读全文
posted @ 2016-10-02 15:15 qscqesze 阅读(305) 评论(0) 推荐(0) 编辑
UVALive 6910 Cutting Tree 并查集
摘要：Cutting Tree 题目连接： https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4922 Description Tree in gra 阅读全文
posted @ 2016-08-03 18:55 qscqesze 阅读(274) 评论(0) 推荐(0) 编辑
UVALive 6906 Cluster Analysis 并查集
摘要：Cluster Analysis 题目连接： https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4918 Description Cluster 阅读全文
posted @ 2016-08-03 18:25 qscqesze 阅读(276) 评论(0) 推荐(0) 编辑
Educational Codeforces Round 14 D. Swaps in Permutation 并查集
摘要：D. Swaps in Permutation 题目连接： http://www.codeforces.com/contest/691/problem/D Description You are given a permutation of the numbers 1, 2, ..., n and 阅读全文
posted @ 2016-08-01 15:16 qscqesze 阅读(424) 评论(2) 推荐(0) 编辑
UVALive 6889 City Park 并查集
摘要：City Park 题目连接： http://acm.hust.edu.cn/vjudge/contest/view.action?cid=122283 problem/F Description Porto is blessed with a beautiful city park. The pa 阅读全文
posted @ 2016-07-16 23:34 qscqesze 阅读(541) 评论(0) 推荐(0) 编辑
Codeforces Round #360 (Div. 1) D. Dividing Kingdom II 暴力并查集
摘要：D. Dividing Kingdom II 题目连接： http://www.codeforces.com/contest/687/problem/D Description Long time ago, there was a great kingdom and it was being rul 阅读全文
posted @ 2016-06-30 21:17 qscqesze 阅读(582) 评论(0) 推荐(0) 编辑
Codeforces Round #346 (Div. 2) F. Polycarp and Hay 并查集 bfs
摘要：F. Polycarp and Hay 题目连接： http://www.codeforces.com/contest/659/problem/F Description The farmer Polycarp has a warehouse with hay, which can be repre 阅读全文
posted @ 2016-03-31 19:03 qscqesze 阅读(467) 评论(1) 推荐(0) 编辑
HDU 5652 India and China Origins 二分+并查集
摘要：India and China Origins 题目连接： http://acm.hdu.edu.cn/showproblem.php?pid=5652 Description A long time ago there are no himalayas between India and Chin 阅读全文
posted @ 2016-03-26 23:23 qscqesze 阅读(336) 评论(0) 推荐(0) 编辑
Codeforces Round #345 (Div. 1) E. Clockwork Bomb 并查集
摘要：E. Clockwork Bomb 题目连接： http://www.codeforces.com/contest/650/problem/E Description My name is James diGriz, I'm the most clever robber and treasure h 阅读全文
posted @ 2016-03-09 14:03 qscqesze 阅读(455) 评论(0) 推荐(0) 编辑
Codeforces Round #345 (Div. 2) E. Table Compression 并查集
摘要：E. Table Compression 题目连接： http://www.codeforces.com/contest/651/problem/E Description Little Petya is now fond of data compression algorithms. He has 阅读全文
posted @ 2016-03-08 10:59 qscqesze 阅读(612) 评论(0) 推荐(0) 编辑
HDU 5631 Rikka with Graph 暴力 并查集
摘要：Rikka with Graph 题目连接： http://acm.hdu.edu.cn/showproblem.php?pid=5631 Description As we know, Rikka is poor at math. Yuta is worrying about this situa 阅读全文
posted @ 2016-02-22 12:10 qscqesze 阅读(473) 评论(1) 推荐(1) 编辑
Educational Codeforces Round 7 C. Not Equal on a Segment 并查集
摘要：C. Not Equal on a Segment 题目连接： http://www.codeforces.com/contest/622/problem/C Description You are given array a with n integers and m queries. The i 阅读全文
posted @ 2016-02-12 14:51 qscqesze 阅读(360) 评论(0) 推荐(0) 编辑
Codeforces Educational Codeforces Round 5 C. The Labyrinth 带权并查集
摘要：<center C. The Labyrinth</center 题目连接：http://www.codeforces.com/contest/616/problem/C DescriptionYou are given a rectangular field of n × m cells. E... 阅读全文
posted @ 2016-01-13 14:17 qscqesze 阅读(440) 评论(0) 推荐(0) 编辑
Codeforces Round #181 (Div. 2) B. Coach 带权并查集
摘要：<center B. Coach</center 题目连接：http://www.codeforces.com/contest/300/problem/A DescriptionA programming coach has n students to teach. We know that n... 阅读全文
posted @ 2016-01-10 15:54 qscqesze 阅读(420) 评论(0) 推荐(0) 编辑
BZOJ 2733: [HNOI2012]永无乡 启发式合并treap
摘要：2733: [HNOI2012]永无乡Time Limit: 20 SecMemory Limit: 256 MB题目连接http://www.lydsy.com/JudgeOnline/problem.php?id=2733Description永无乡包含 n 座岛，编号从 1 到 n，每座岛都有... 阅读全文
posted @ 2015-11-16 16:43 qscqesze 阅读(412) 评论(0) 推荐(0) 编辑
Educational Codeforces Round 1 D. Igor In the Museum bfs 并查集
摘要：D. Igor In the MuseumTime Limit: 20 SecMemory Limit: 256 MB题目连接http://codeforces.com/contest/598/problem/DDescriptionIgor is in the museum and he want... 阅读全文
posted @ 2015-11-15 09:14 qscqesze 阅读(449) 评论(0) 推荐(0) 编辑

1 2 下一页
点击右上角即可分享
微信分享提示