Optimal Dynamic Programming Algorithm Based on RMQ
ZOU Yujin
Abstract: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.
Keywords:dynamic programmingdata structuresegment treeRMQoptimization algorithm
Publication Date:2014-01-01
Online Publishing Date:2025-08-15(First online date of this platform, not the publication date of the document)
Pages:6( 430-435 )
