线段树
DKChan
这个作者很懒,什么都没留下…
展开
-
ZOJ3886 2015July月赛 F-Nico Number(线段树)
Kousaka Honoka and Minami Kotori are playing a game about a secret of Yazawa Nico.When the game starts, Kousaka Honoka will give Minami Kotori an array A of N non-negative integers. There is a special原创 2015-08-02 16:33:18 · 443 阅读 · 0 评论 -
hdu 4578 Transformation (线段树)
http://acm.hdu.edu.cn/showproblem.php?pid=4578TransformationTime Limit: 15000/8000 MS (Java/Others) Memory Limit: 65535/65536 K (Java/Others) Total Submission(s): 3384 Accepted Submission(s): 81原创 2015-07-22 21:39:54 · 563 阅读 · 0 评论 -
CodeChef.July.5th - Addition and Multiplication
Addition and Multiplicationhttps://www.codechef.com/problems/ADDMUL You are given a one dimensional integer array A of length N. You need to maintain the array under Q queries of the following four ty原创 2015-07-22 21:28:28 · 432 阅读 · 0 评论