摘要
讨论了基于RMQ的一种动态规划基本思想和解题步骤.利用线段树优化动态规划,提高对大规模数据处理的方法和技巧,在线段树基础上利用树状数组合理地解决了动态规划占用大量内存的问题.
This paper discusses the basic idea of the dynamic programming and problem-solving steps based on RMQ.Using segment tree optimization dynamic programming problem cleverly, we can improve methods and techniques for large-scale data processing, and rationally solve the problem of dynamic pro-gramming running memory intensively by the tree array which based on the segment tree.
出处
《湖北民族学院学报（自然科学版）》
CAS
2014年第4期430-435,共6页
Journal of Hubei Minzu University(Natural Science Edition)
基金
浙江省自然科学基金项目(LQ13G02000)
关键词
动态规划
数据结构
线段树
RMQ
优化算法
dynamic programming
data structure
segment tree
RMQ
optimization algorithm
