![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
BestCoder
文章平均质量分 84
chen476328361
这个作者很懒,什么都没留下…
展开
-
树状数组
树状数组(Binary Indexed Tree(BIT), Fenwick Tree)是一个查询和修改复杂度都为log(n)的数据结构。主要用于查询任意两位之间的所有元素之和,但是每次只能修改一个元素的值;经过简单修改可以在log(n)的复杂度下进行范围修改,但是这时只能查询其中一个元素的值。原创 2014-09-30 22:04:25 · 440 阅读 · 0 评论 -
HDOJ 5057 Argestes and Sequence
Argestes and SequenceTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 273 Accepted Submission(s): 14Problem DescriptionArges原创 2014-10-02 21:42:41 · 479 阅读 · 0 评论 -
(BestCoder Round #14) 1002 Harry And Dig Machine(状态压缩+DP;剪枝+搜索;全排列)
Harry And Dig MachineTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 410 Accepted Submission(s): 76Problem Description As原创 2014-10-20 22:34:11 · 688 阅读 · 0 评论 -
HDOJ 5021 Revenge of kNN II
5021 Revenge of kNN IITime Limit: 8000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 196 Accepted Submission(s): 56Problem DescriptionIn pat原创 2014-10-04 18:30:04 · 459 阅读 · 0 评论