该问题要求在给定的钢琴键序列中找到最长的重复音乐主题，即至少五音符长且在序列中非重叠地重复出现的子序列。可以使用动态规划（DP）方法解决，通过计算不同起点的重复子序列长度来找到最大值。
Brian Dean
A musical melody is represented as a sequence of N (1 <= N <= 5000) notes that are integers in the range 1..88, each representing a key on the piano. It is unfortunate but true that this representation of melodies ignores the notion of musical timing; but, this programming task is about notes and not timings.
Many composers structure their music around a repeating "theme", which, being a subsequence of an entire melody, is a sequence of integers in our representation. A subsequence of a melody is a theme if it:
- is at least five notes long
- appears (potentially transposed -- see below) again somewhere else in the piece of music
- is disjoint from (i.e.,
最低0.47元/天 解锁文章
扫一扫
308
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
