
STL标准库容器
文章平均质量分 83
yyPurpose_forever
FIGHTING
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
hdu5688
Problem D Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 857 Accepted Submission(s): 525 Problem Description 度熊所居住的 D 国,是一个完全尊重原创 2017-07-30 17:06:29 · 265 阅读 · 0 评论 -
hdu6168
Numbers Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 854 Accepted Submission(s): 441 Problem Description zk has n numbers a原创 2017-08-24 19:59:33 · 231 阅读 · 0 评论 -
codeforces 865b
B. Ordering Pizza time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output It's another Start[c]up finals, and that转载 2017-10-04 16:57:33 · 532 阅读 · 0 评论 -
codeforces940e(dp)
E. Cashback time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Since you are the best Wraith King, Nizhniy Mag原创 2018-02-26 22:00:30 · 231 阅读 · 0 评论 -
codeforces923b(前缀和 优先队列)
B. Producing Snow time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Alice likes snow a lot! Unfortunately, thi原创 2018-03-19 22:54:22 · 384 阅读 · 0 评论 -
codeforces981e(线段树+bitset)
E. Addition on Segmentstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGrisha come to a contest and faced the following problem.You are given an a...原创 2018-07-02 17:47:19 · 362 阅读 · 0 评论 -
hdu5972(bitset)
Regular NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1746 Accepted Submission(s): 488Problem DescriptionUsing regular expression to ...原创 2018-07-03 18:40:06 · 431 阅读 · 0 评论 -
hdu5745(dp+bitset)
La Vie en roseTime Limit: 7000/3500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3584 Accepted Submission(s): 940Problem DescriptionProfessor Zhang would like t...原创 2018-07-04 17:08:04 · 285 阅读 · 0 评论 -
hdu6251(基环树)
传送门:http://acm.hdu.edu.cn/showproblem.php?pid=6251 题意:有一个n个点的图,有n条边(基环树),每条边有一种颜色,现在有m次操作(前后有影响),每次操作后求出当前的Region数(同一个Region是连通的且颜色一样)。 思路:采用map记录每一个节点所连边的颜色数,再通过dfs求出环,并记录哪些边在环上,以及用map来统计环上的颜色。通过每个...原创 2019-07-02 22:01:43 · 375 阅读 · 0 评论