twitch (amazon) phone interview 应该是挂了

废话少说，上题，求大米：

# Alice and Bob work in a beautiful orchard. There are N apple trees in the orchard. The apple trees are arranged in a row and they are numbered from 1 to N.

# Alice is planning to collect all the apples from K consecutive trees and Bob is planning to collect all the apples from L consecutive trees. They want to choose two disjoint segments (one consistin

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

he range [2..600];
# K and L are integers within the range [1..N − 1];
# each element of array A is an integer within the range [1..500].
# In your solution, focus on correctness. The performance of your solution will not be the focus of the assessment.

# In your solution, focus on correctness. The performance of your solution will not be the focus of the assessment.
所以直接两个for就可以对吧？（第一个for过程中外加判定是否满足可以同时两个人足够的长度采摘）

首先转换到长度为K，L的区间和
然后求从某个点向左看和向右看L长度区间的max值的dp数组

然后for循环试探每个K区间

今天跟HR电话联系了，这个是codility assessment吗？只有一道题么？