KTV最优点歌策略问题算法分析与研究  

Algorithm Analysis and Research of KTV Best Song Request Strategy

作　　者：刁航 金昕怡 DIAO Hang;JIN Xin-yi(College of Information and Computer Engineering,Northeast Forestry University,Harbin 150040 China;College of Mechanical and Electrical Engineering,Northeast Forestry University,Harbin 150040 China)

机构地区：[1]东北林业大学信息与计算机工程学院,黑龙江哈尔滨150040 [2]东北林业大学机电工程学院,黑龙江哈尔滨150040

出　　处：《科技创新与生产力》2021年第5期34-36,共3页Sci-tech Innovation and Productivity

摘　　要：本文分别采用贪心算法和动态规划算法处理KTV最优点歌策略问题并进行对比,验证了在一定演唱时长与确定备选曲目的双重限制下解决KTV最优点歌策略问题中算法选择的重要性,以及动态规划算法在解决该问题时可以得到一组精确最优解的算法优越性。This paper uses greedy algorithm and dynamic programming algorithm to deal with KTV best song request strategy problem and compares them.It verifies the importance of algorithm selection in solving KTV best song request strategy problem under the dual constraints of a certain singing time and determining candidate song,and the superiority of dynamic programming algorithm that can obtain a set of accurate optimal solutions when solving this problem.

关 键 词：最优点歌策略 贪心算法 动态规划算法 

分 类 号：TP311.5[自动化与计算机技术—计算机软件与理论]