随笔分类 -  分块

NBUT校赛 J Alex’s Foolish Function（分块+延迟标记）
摘要：Problem J: Alex’s Foolish Function Description Alex has an array F which size is n, initially each element’s value is zero. Now he wants to operate th 阅读全文
posted @ 2017-07-23 09:23 Blackops 阅读(253) 评论(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-06-10 20:27 Blackops 阅读(259) 评论(0) 推荐(0)
Educational Codeforces Round 22 E. Army Creation（分块好题）
摘要：E. Army Creation time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output E. Army Creation time l 阅读全文
posted @ 2017-06-08 20:50 Blackops 阅读(306) 评论(0) 推荐(0)
ACdream 1738 世风日下的哗啦啦族I（分块大法+二分）
摘要：世风日下的哗啦啦族I Time Limit: 4000/2000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others) Submit Statistic Next Problem Problem Description "世风日下啊，女 阅读全文
posted @ 2017-05-19 10:06 Blackops 阅读(183) 评论(0) 推荐(0)
HDU 4391 Paint The Wall（分块+延迟标记）
摘要：Paint The Wall Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3427 Accepted Submission(s): 95 阅读全文
posted @ 2017-05-11 21:43 Blackops 阅读(575) 评论(0) 推荐(0)
SPOJ COT2 - Count on a tree II（LCA+离散化+树上莫队）
摘要：COT2 - Count on a tree II #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 阅读全文
posted @ 2017-02-17 21:22 Blackops 阅读(415) 评论(0) 推荐(0)
HDU 1166 敌兵布阵（分块）
摘要：敌兵布阵 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 80671 Accepted Submission(s): 34073 Problem 阅读全文
posted @ 2016-12-02 00:06 Blackops 阅读(311) 评论(0) 推荐(0)