要努力成为别人的依赖 弱弱一枚 halfyarn
  半根毛线 计数er: AmazingCounters.com 位小伙伴来看过~

随笔分类 -  数据结构 STL 优先队列

Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) A B C D 水 模拟 并查集 优先队列
摘要:A. Broken Clock time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A. Broken Clock time limi 阅读全文
posted @ 2016-10-03 23:55 半根毛线 阅读(618) 评论(0) 推荐(0)
Codeforces Round #374 (Div. 2) A B C D 水 模拟 dp+dfs 优先队列
摘要:A. One-dimensional Japanese Crossword time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A. 阅读全文
posted @ 2016-10-01 20:28 半根毛线 阅读(309) 评论(0) 推荐(0)
cdoj 482 优先队列+bfs
摘要:Charitable Exchange Charitable Exchange Time Limit: 4000/2000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others) Submit Status Have you ever he 阅读全文
posted @ 2016-08-01 18:14 半根毛线 阅读(374) 评论(0) 推荐(0)
poj 3053 优先队列处理
摘要:Fence Repair Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 39029 Accepted: 12681 Description Farmer John wants to repair a small length o 阅读全文
posted @ 2016-07-16 16:11 半根毛线 阅读(213) 评论(0) 推荐(0)
Codeforces Round #357 (Div. 2) C
摘要:C. Heap Operations time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output C. Heap Operations tim 阅读全文
posted @ 2016-06-23 22:59 半根毛线 阅读(197) 评论(0) 推荐(0)
UVA 11995 STL 使用
摘要:There is a bag-like data structure, supporting two operations: Throw an element x into the bag. Take out an element from the bag. Given a sequence of 阅读全文
posted @ 2016-04-20 20:52 半根毛线 阅读(243) 评论(0) 推荐(0)

 
halfyarn@gmail.com