02 2017 档案

Codeforces Round #352 (Div. 1) B. Robin Hood （二分）
摘要：B. Robin Hood time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output We all know the impressive 阅读全文
posted @ 2017-02-28 23:05 贱人方 阅读(217) 评论(0) 推荐(0)
Codeforces Round #209 (Div. 2) D. Pair of Numbers （模拟）
摘要：D. Pair of Numbers time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Simon has an array a1 阅读全文
posted @ 2017-02-28 15:42 贱人方 阅读(299) 评论(0) 推荐(0)
Kattis - boxes （dfn序）
摘要：Boxes Boxes Boxes There are N There are N boxes, indexed by a number from 1 to N . Each box may (or not may not) be put into other boxes. These boxes 阅读全文
posted @ 2017-02-28 12:22 贱人方 阅读(341) 评论(0) 推荐(0)
kattis Curious Cupid (莫队算法)
摘要：Curious Cupid Curious Cupid Curious Cupid There are K There are K different languages in the world. Each person speaks one and only one language. Ther 阅读全文
posted @ 2017-02-27 22:40 贱人方 阅读(414) 评论(0) 推荐(0)
HYSBZ - 2038 小Z的袜子 （莫队算法）
摘要：A1206. 小Z的袜子 时间限制：1.0s 内存限制：512.0MB 总提交次数：744 AC次数：210 平均分：44.44 时间限制：1.0s 内存限制：512.0MB 总提交次数：744 AC次数：210 平均分：44.44 将本题分享到： 查看未格式化的试题 提交 试题讨论 将本题分享到： 阅读全文
posted @ 2017-02-27 20:48 贱人方 阅读(230) 评论(0) 推荐(0)
SPOJ NETADMIN - Smart Network Administrator（二分）（网络流）
摘要：NETADMIN - Smart Network Administrator #max-flow #max-flow The citizens of a small village are tired of being the only inhabitants around without a co 阅读全文
posted @ 2017-02-26 22:11 贱人方 阅读(342) 评论(0) 推荐(0)
SPOJ UOFTCG - Office Mates （树的最小路径覆盖）
摘要：UOFTCG - Office Mates no tags no tags Dr. Baws has an interesting problem. His N Dr. Baws has an interesting problem. His N graduate students, while f 阅读全文
posted @ 2017-02-25 18:11 贱人方 阅读(308) 评论(0) 推荐(0)
SPOJ IITWPC4F - Gopu and the Grid Problem （双线段树区间修改 区间查询）
摘要：Gopu and the Grid Problem Gopu is interested in the integer co-ordinates of the X-Y plane (0<=x,y<=100000). Each integer coordinate contain a lamp, in 阅读全文
posted @ 2017-02-25 18:05 贱人方 阅读(303) 评论(0) 推荐(0)
ＰＯＪ　３２８１　Dining（网络流）
摘要：Dining Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 16967 Accepted: 7535 Description Cows are such finicky eaters. Each cow has a prefer 阅读全文
posted @ 2017-02-23 18:48 贱人方 阅读(261) 评论(0) 推荐(0)
POJ 1741 Tree （点分治）
摘要：Tree Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 20816 Accepted: 6820 Description Give a tree with n vertices,each edge has a length(po 阅读全文
posted @ 2017-02-23 11:09 贱人方 阅读(156) 评论(0) 推荐(0)
SPOJ PT07J - Query on a tree III(划分树)
摘要：PT07J - Query on a tree III #tree #tree You are given a node-labeled rooted tree with n nodes. Define the query (x, k): Find the node whose label is k 阅读全文
posted @ 2017-02-22 16:06 贱人方 阅读(215) 评论(0) 推荐(0)
hiho一下第134周 1468 : 2-SAT·hihoCoder新春晚会
摘要：1468 : 2-SAT·hihoCoder新春晚会 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 hihoCoder新春晚会正在紧张地筹备中。晚会分为上半场和下半场，总导演小Hi现在要为N个节目安排演出时间(上半场或下半场)。为了描述方便，我们将第i个节目对应两个编 阅读全文
posted @ 2017-02-19 20:24 贱人方 阅读(317) 评论(0) 推荐(0)
UVA Phone List （字典树）（查询是否有前缀或自身是其他的前缀）
摘要：Phone List Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16341 Accepted: 5228 Description Given a list of phone numbers, determine if it 阅读全文
posted @ 2017-02-09 21:12 贱人方 阅读(293) 评论(0) 推荐(0)
HDU 1251 统计难题 （字典树）（查询是否为前缀）
摘要：统计难题 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 37626 Accepted Submission(s): 13858 Problem 阅读全文
posted @ 2017-02-09 21:05 贱人方 阅读(213) 评论(0) 推荐(0)
ZOJ 2112 Dynamic Rankings （动态第 K 大）（树状数组套主席树）
摘要：The Company Dynamic Rankings has developed a new kind of computer that is no longer satisfied with the query like to simply find the k-th smallest num 阅读全文
posted @ 2017-02-07 21:17 贱人方 阅读(336) 评论(1) 推荐(0)
SPOJ 10628 COT - Count on a tree（在树上建立主席树）（LCA）
摘要：COT - Count on a tree #tree #tree You are given a tree with N nodes.The tree nodes are numbered from 1 to N.Each node has an integer weight. We will a 阅读全文
posted @ 2017-02-07 16:04 贱人方 阅读(391) 评论(0) 推荐(0)
POJ 2761 Feed the dogs （主席树）（K-th 值）
摘要：Feed the dogs Time Limit: 6000MS Memory Limit: 65536K Total Submissions: 20634 Accepted: 6494 Description Wind loves pretty dogs very much, and she ha 阅读全文
posted @ 2017-02-07 12:26 贱人方 阅读(413) 评论(0) 推荐(0)
SPOJ 3267 DQUERY - D-query （主席树）（区间数的种数）
摘要：DQUERY - D-query #sorting #tree #sorting #tree English Vietnamese Given a sequence of n numbers a1, a2, ..., an and a number of d-queries. A d-query i 阅读全文
posted @ 2017-02-07 01:06 贱人方 阅读(624) 评论(0) 推荐(0)
HDU 4417 Super Mario （划分树）（二分）
摘要：Super Mario Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6077 Accepted Submission(s): 2645 Pro 阅读全文
posted @ 2017-02-06 15:13 贱人方 阅读(202) 评论(0) 推荐(0)
HDU 3473 Minimum Sum （划分树）
摘要：Minimum Sum Time Limit: 16000/8000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4156 Accepted Submission(s): 941 Pro 阅读全文
posted @ 2017-02-06 00:13 贱人方 阅读(221) 评论(0) 推荐(0)
HDU 4251 The Famous ICPC Team Again(划分树)
摘要：The Famous ICPC Team Again Time Limit: 30000/15000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1440 Accepted Submis 阅读全文
posted @ 2017-02-03 23:43 贱人方 阅读(196) 评论(0) 推荐(0)
POJ 2104 K-th Number （划分树）
摘要：K-th Number Time Limit: 20000MS Memory Limit: 65536K Total Submissions: 52651 Accepted: 18091 Case Time Limit: 2000MS Description You are working for 阅读全文
posted @ 2017-02-03 20:23 贱人方 阅读(153) 评论(0) 推荐(0)