随笔分类 -  数据结构

Splay、LCT、树链剖分、Treap、可持续化线段树、树状数组
Codeforces CF#628 Education 8 E. Zbazi in Zeydabad
摘要：E. Zbazi in Zeydabad time limit per test 5 seconds memory limit per test 512 megabytes input standard input output standard output A tourist wants to 阅读全文
posted @ 2016-12-02 12:38 yanzx6 阅读(438) 评论(0) 推荐(0)
2016 Multi-University Training Contest 2 D. Differencia
摘要：Differencia Time Limit: 10000/10000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 601 Accepted Submission(s): 173 Pro 阅读全文
posted @ 2016-09-01 18:36 yanzx6 阅读(208) 评论(0) 推荐(0)
2016中国大学生程序设计竞赛 - 网络选拔赛 J. Alice and Bob
摘要：Alice and Bob Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 147 Accepted Submission(s): 22 P 阅读全文
posted @ 2016-08-25 11:21 yanzx6 阅读(522) 评论(0) 推荐(0)
2016中国大学生程序设计竞赛 网络选拔赛 I This world need more Zhu
摘要：This world need more Zhu Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 262 Accepted Submission 阅读全文
posted @ 2016-08-25 10:59 yanzx6 阅读(426) 评论(0) 推荐(0)
51nod p1175 区间中第K大的数
摘要：1175 区间中第K大的数 基准时间限制：1 秒 空间限制：131072 KB 分值: 160 难度：6级算法题 一个长度为N的整数序列，编号0 - N - 1。进行Q次查询，查询编号i至j的所有数中，第K大的数是多少。 例如: 1 7 6 3 1。i = 1, j = 3，k = 2，对应的数为7 阅读全文
posted @ 2016-03-04 21:07 yanzx6 阅读(327) 评论(0) 推荐(0)
ural 2062 Ambitious Experiment
摘要：2062. Ambitious Experiment Time limit: 3.0 secondMemory limit: 128 MB During several decades, scientists from planet Nibiru are working to create an e 阅读全文
posted @ 2016-03-04 10:10 yanzx6 阅读(508) 评论(0) 推荐(0)
ural 1251. Cemetery Manager
摘要：1251. Cemetery ManagerTime limit: 1.0 secondMemory limit: 64 MBThere is a tradition at the USU championships to call the most hard-to-solve problems c... 阅读全文
posted @ 2015-12-26 10:40 yanzx6 阅读(274) 评论(0) 推荐(0)
ACM ICPC 2015 Moscow Subregional Russia, Moscow, Dolgoprudny, October, 18, 2015 K. King’s Rout
摘要：K. King's Routtime limit per test4 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputThe great rout will be held this e... 阅读全文
posted @ 2015-12-25 10:16 yanzx6 阅读(304) 评论(0) 推荐(0)
ACM ICPC 2015 Moscow Subregional Russia, Moscow, Dolgoprudny, October, 18, 2015 G. Garden Gathering
摘要：Problem G. Garden Gathering Input file: standard input Output file: standard output Time limit: 3 seconds Memory limit: 512 megabytes Many of you may ... 阅读全文
posted @ 2015-12-25 10:01 yanzx6 阅读(535) 评论(0) 推荐(0)
CF# Educational Codeforces Round 3 F. Frogs and mosquitoes
摘要：F. Frogs and mosquitoestime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputThere arenfrogs sitting o... 阅读全文
posted @ 2015-12-22 22:10 yanzx6 阅读(422) 评论(0) 推荐(0)
CF# Educational Codeforces Round 3 E. Minimum spanning tree for each edge
摘要：E. Minimum spanning tree for each edgetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputConnected ... 阅读全文
posted @ 2015-12-22 22:05 yanzx6 阅读(308) 评论(0) 推荐(0)
The 2015 China Collegiate Programming Contest C. The Battle of Chibi hdu 5542
摘要：The Battle of ChibiTime Limit: 6000/4000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 591Accepted Submission(s): 192P... 阅读全文
posted @ 2015-12-21 15:43 yanzx6 阅读(205) 评论(0) 推荐(0)
CF#335 Board Game
摘要：Board Gametime limit per test2.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are playing a board card game. I... 阅读全文
posted @ 2015-12-21 09:53 yanzx6 阅读(521) 评论(0) 推荐(0)
CF#335 Lazy Student
摘要：Lazy Studenttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputStudent Vladislav came to his progra... 阅读全文
posted @ 2015-12-21 09:31 yanzx6 阅读(306) 评论(0) 推荐(0)