05 2017 档案

Poj 1651 Multiplication Puzzle(区间dp)
摘要:Multiplication Puzzle Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10010 Accepted: 6188 Description The multiplication puzzle is played 阅读全文

posted @ 2017-05-13 20:01 Yxter 阅读(142) 评论(0) 推荐(0)

Poj 2955 brackets(区间dp)
摘要:Brackets Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7795 Accepted: 4136 Description We give the following inductive definition of a “r 阅读全文

posted @ 2017-05-13 16:45 Yxter 阅读(166) 评论(0) 推荐(0)

HDU 5875 Function (线段树+gcd / 单调栈)
摘要:题意:给你一串数a再给你一些区间(lef,rig),求出a[lef]%a[lef+1]...%a[rig] 题解:我们可以发现数字a对数字b取模时:如果a<b,则等于原数,否则a会变小至少一半。就是说a最多成功取模(log2 a)次,所以我们只需要每次在区间内找到最前面一个小于等于a的值,接着更新a 阅读全文

posted @ 2017-05-05 17:12 Yxter 阅读(219) 评论(0) 推荐(0)

导航