ACM_数据结构
bless295
人一我十,人十我万,永不放弃——kuangbin
展开
-
C. Sereja and Brackets----线段树
C. Sereja and Bracketstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSereja has a bracket sequence s1, s2,原创 2017-09-03 09:03:29 · 550 阅读 · 0 评论 -
H - The Battle of Chibi ----dp+树状数组
Cao Cao made up a big army and was going to invade the whole South China. Yu Zhou was worried about it. He thought the only way to beat Cao Cao is to have a spy in Cao Cao's army. But all generals and原创 2017-04-21 21:02:51 · 369 阅读 · 0 评论 -
E - Largest Rectangle in a Histogram ----单调栈
E - Largest Rectangle in a Histogram POJ - 2559 A histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths but may have diffe原创 2017-04-06 21:46:55 · 333 阅读 · 0 评论 -
B. Pipeline----二分答案
B. Pipelinetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVova, the Ultimate Thule new shaman, wants to b原创 2017-04-05 16:37:25 · 469 阅读 · 0 评论 -
B - Hanami Party ----贪心+栈
Saigyouji Yuyuko and Konpaku Youmu are going to hold a hanami party (a Japanese traditional custom of enjoying the beauty of cherry blossoms). They decide to invite all their friends to come to the ya原创 2017-04-17 19:10:06 · 320 阅读 · 0 评论 -
L2-005. 集合相似度----set
L2-005. 集合相似度时间限制400 ms内存限制65536 kB代码长度限制8000 B判题程序Standard作者陈越给定两个整数集合,它们的相似度定义为:Nc/Nt*100%。其中Nc是两个集合都有的不相等整数的个数,Nt是两个集合一共有的不原创 2017-03-16 20:32:19 · 308 阅读 · 0 评论 -
splay_tree学习+模板
自从看懂splay_tree(也有叫spaly_tree)后,昨晚敲了第一发281行,已经被恶心死,难倒是不难,就是细节,看了大牛的博客,本想自己总结一发,结果图不好弄,我差不多已经是个废C~K了,先学AVL,懂了后看splay_tree就很容易了,无非就是多加了几种旋转,注意分解合并,splay_tree可能单次查询不如AVL,但是大量查询并且多次重复查询的时候他就比AVL快了好多,可以说多次查原创 2017-03-20 17:25:44 · 322 阅读 · 0 评论 -
Changing Digits----dfs+强剪枝
Changing DigitsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 3485 Accepted: 1136DescriptionGiven two positive integers n and k, you are asked to gen原创 2017-03-27 19:36:35 · 250 阅读 · 0 评论 -
B. Bear and Friendship Condition----并查集或BFS
B. Bear and Friendship Conditiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBear Limak examines a socia原创 2017-03-28 21:31:19 · 1304 阅读 · 0 评论 -
Paid Roads----DFS
Paid RoadsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7023 Accepted: 2602DescriptionA network of m roads connects N cities (numbered from 1 to N).原创 2017-02-09 00:30:59 · 259 阅读 · 0 评论 -
D. Mahmoud and a Dictionary----带权并查集
D. Mahmoud and a Dictionarytime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMahmoud wants to write a new di原创 2017-02-08 13:55:17 · 505 阅读 · 0 评论 -
Apple Tree-----树状数组
Apple TreeTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 27759 Accepted: 8241DescriptionThere is an apple tree outside of kaka's house. Every autumn,原创 2017-01-14 17:38:28 · 496 阅读 · 0 评论 -
Mobile phones--树状数组
Mobile phonesTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 18824 Accepted: 8685DescriptionSuppose that the fourth generation mobile phone base stati原创 2016-12-30 15:33:15 · 301 阅读 · 0 评论 -
D - Cutting Tree----并查集
D - Cutting Tree UVALive - 6910 题目链接:https://cn.vjudge.net/contest/161621#problem/D题目的意思是说给你一个森林,两个操作,1是去掉与他父亲的连边,2是查询xy是否在同一个连通块里面。我们使用并查集,逆序来,把去边变为加边,然后判断连通性。队友敲得代码代码:#include using原创 2017-05-05 16:31:13 · 602 阅读 · 0 评论 -
J - Slim Span 思维+并查集
J - Slim Span POJ - 3522 Given an undirected weighted graph G, you should find one of spanning trees specified as follows.The graph G is an ordered pair (V, E), where V is a set of ver原创 2017-05-05 16:49:12 · 458 阅读 · 0 评论 -
Problem J: Color Circle----dfs
Problem J: Color CircleTime Limit: 1 Sec Memory Limit: 1280 MBSubmit: 212 Solved: 58[Submit][Status][Web Board]Description There are colorful flowers in the parterre in front of原创 2017-04-24 19:22:00 · 303 阅读 · 0 评论 -
B. Preparing for the Contest----二分+贪心
B. Preparing for the Contesttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSoon there will be held the wo原创 2017-08-29 00:43:59 · 422 阅读 · 0 评论 -
百度之星初赛(B)--小小粉丝度度熊----离散化/二分
小小粉丝度度熊Accepts: 1075Submissions: 5191Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Problem Description度度熊喜欢着喵哈哈村的大明星——星星小姐。为什么度度熊会喜欢星原创 2017-08-13 22:39:03 · 278 阅读 · 0 评论 -
百度之星初赛(B)--度度熊的交易计划----最小费用最大流
度度熊的交易计划Accepts: 460Submissions: 2329Time Limit: 12000/6000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Problem Description度度熊参与了喵哈哈村的商业大会,但是这次商业大会遇到了一个难题:原创 2017-08-13 22:36:17 · 303 阅读 · 0 评论 -
百度之星初赛(B)--Factory---虚树/比格思茅/LCA
FactoryAccepts: 100Submissions: 383Time Limit: 20000/10000 MS (Java/Others)Memory Limit: 132768/132768 K (Java/Others)Problem Description我们将A省简化为由N个城市组成,某些城市之间存在双向道路,而且原创 2017-08-13 22:29:15 · 721 阅读 · 0 评论 -
百度之星初赛(A)--数据分割----启发式合并
数据分割Accepts: 202Submissions: 1332Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Problem Description小w来到百度之星的赛场上,准备开始实现一个程序自动分析系统。这个程序接原创 2017-08-13 22:17:47 · 452 阅读 · 0 评论 -
百度之星初赛(A)--度度熊的01世界----bfs搜索
度度熊的01世界Accepts: 967Submissions: 3064Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Problem Description度度熊是一个喜欢计算机的孩子,在计算机的世界中,所有事物实际上都只原创 2017-08-13 21:57:03 · 277 阅读 · 0 评论 -
C. Inna and Dima----dfs
C. Inna and Dimatime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputInna and Dima bought a table of size n × m原创 2017-08-20 15:16:19 · 313 阅读 · 0 评论 -
B. Sereja ans Anagrams----map维护queue
B. Sereja ans Anagramstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSereja has two sequences a and b and原创 2017-08-10 22:56:32 · 231 阅读 · 0 评论 -
C. Hamburgers----二分
C. Hamburgerstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarpus loves hamburgers very much. He espe原创 2017-08-17 00:32:11 · 473 阅读 · 0 评论 -
A. Knight Tournament----并查集
A. Knight Tournamenttime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputHooray! Berl II, the king of Berland i原创 2017-07-31 13:02:53 · 387 阅读 · 0 评论 -
哈密顿绕行世界问题 ----dfs
哈密顿绕行世界问题Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4294 Accepted Submission(s): 2590Problem Description一个规则的实心十二面体,它的 2原创 2017-05-16 21:38:41 · 224 阅读 · 0 评论 -
Highway 湘潭邀请赛(江苏省赛)----树的直径
叉姐出的题,题目在ICPC camp里,是pdf,我就没有复制。树的直径裸题,不会树的直径的建议去百度。先求出树的直径的两个端点,然后把所有点往这两个端点上连就可以了。补题在camp上代码:#include #include #include #include #define inf 0x3f3f3f3f#define LL long longusing names原创 2017-05-16 20:18:16 · 469 阅读 · 0 评论 -
Stars--树状数组
StarsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 44636 Accepted: 19380DescriptionAstronomers often examine star maps where stars are represented b原创 2016-12-30 15:45:59 · 463 阅读 · 0 评论 -
Kuhn-Munkres算法(二分图最大权匹配)
Kuhn-Munkres算法(二分图最大权匹配)这篇博客没有题,就是简单的说一下KM算法,今天花了两个小时学KM算法,总算明白了基本套路和基本原理,但是,有一个点从头到尾我都没有懂,lx[i]+ly[j]>weight[i][j]为什么是进入二分子图的条件,从百度上搜了也没有解释,GG了。还有就是这个式子求出来的值为何就是不合法匹配和合法匹配的最小差值,就这两个问题,一直搞不懂.....好迷啊原创 2016-11-15 16:22:04 · 7152 阅读 · 2 评论 -
Going Home--最小费用最大流
Going HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 22013 Accepted: 11127DescriptionOn a grid map there are n little men and n houses. In each uni原创 2016-11-11 22:07:48 · 283 阅读 · 0 评论 -
River Hopscotch--二分答案
River HopscotchTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 11615 Accepted: 5004DescriptionEvery year the cows hold an event featuring a peculiar v原创 2016-08-10 20:58:22 · 356 阅读 · 0 评论 -
Instant Complexity--模拟
Instant ComplexityTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2045 Accepted: 709DescriptionAnalyzing the run-time complexity of algorithms is an i原创 2016-08-22 14:52:45 · 352 阅读 · 0 评论 -
Lucky and Good Months by Gregorian Calendar--模拟
Lucky and Good Months by Gregorian CalendarTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1748 Accepted: 588DescriptionHave you ever wondered why nor原创 2016-08-22 11:18:09 · 387 阅读 · 0 评论 -
Joint Stacks--模仿栈
Joint StacksTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 540 Accepted Submission(s): 248Problem DescriptionA stack is a da原创 2016-08-10 01:51:39 · 560 阅读 · 0 评论 -
Squares--二分查找
SquaresTime Limit: 3500MS Memory Limit: 65536KTotal Submissions: 18844 Accepted: 7257DescriptionA square is a 4-sided polygon whose sides have equal length and原创 2016-08-05 21:20:41 · 571 阅读 · 0 评论 -
ACM Computer Factory--最大流EK()算法
ACM Computer FactoryTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7026 Accepted: 2486 Special JudgeDescriptionAs you know, all the computers use原创 2016-08-17 19:47:02 · 472 阅读 · 0 评论 -
Power Network--最大流的EK()算法
Power NetworkTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 27108 Accepted: 14083DescriptionA power network consists of nodes (power stations, consum原创 2016-08-17 14:49:21 · 688 阅读 · 0 评论 -
Flip Game----状压(枚举)
Flip GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 38784 Accepted: 16851DescriptionFlip game is played on a rectangular 4x4 field with two-sided p原创 2016-05-16 18:57:13 · 477 阅读 · 0 评论 -
广度优先搜索练习之神奇的电梯----BFS
广度优先搜索练习之神奇的电梯Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述有一座已知层数为n的高楼,这座高楼的特殊之处在于只能靠电梯去上下楼,所以要去到某一层要非常耽误时间,然而更悲哀的是,这座高楼的电梯是限号的,小鑫最开始的时候在1层,他想去第x层,问题是他最起码要经过多少层(包含原创 2016-05-19 19:10:26 · 1330 阅读 · 0 评论