题目
CPSC_V 320 201/202/203 2024W2 Reading Quiz #6 (Greedy Algorithms 1)
单项选择题
In an instance of the "Interval Scheduling" problem, assume that i1,…,ikis the list of jobs in A (the output of our greedy algorithm), and j1,…,jk is another optimal solution. Consider these new sequences of jobs: S1=i1,…,il,jl+1,…,jk(forsomels.t.1<l<k) S2=j1,…,jl,il+1,…,ik(forsomels.t.1<l<k) Which one(s) are always valid (non-overlapping) solutions?
查看解析
标准答案
Please login to view
思路分析
Reframe the problem in your own words: we have two sequences of non-overlapping interval jobs, i1, …, ik coming from the greedy interval scheduling algorithm, and j1, …, jk representing some other optimal solution. We form two stitched sequences by taking a prefix from one solution and a suffix from the other, and we want to know which stitched sequences are guaranteed to be non-overlapping.
Option under consideration: S1 is always valid, but S2 can sometimes be invalid.
Analysis of S1 (i1, …, il, jl+1, …, jk):
- Up to i_l, the schedule is non-overlapping by the construction of i1, …, ik from the greedy al......Login to view full explanation登录即可查看完整答案
我们收录了全球超50000道考试原题与详细解析,现在登录,立即获得答案。
类似问题
In a consumer society, many adults channel creativity into buying things
Economic stress and unpredictable times have resulted in a booming industry for self-help products
People born without creativity never can develop it
A product has a selling price of $20, a contribution margin ratio of 40% and fixed cost of $120,000. To make a profit of $30,000. The number of units that must be sold is: Type the number without $ and a comma. Eg: 20000
更多留学生实用工具
希望你的学习变得更简单
加入我们,立即解锁 海量真题 与 独家解析,让复习快人一步!