[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fdBQ19bxkxEDDCpgNrlI50ZitDtTJxxb4pi8KHtvcqbk":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":16,"related":17,"source":21,"type":22},[],"2026-03-27 22:05:53",329987928,[8,9,10,11],"总能求得最优解,保证两艘船都装满","效率低于贪心算法,通常不用","可以求出解,但不一定能把两艘船装满","无法求解,也不能保证两艘船都装满",{"courseId":13,"courseImg":14,"courseName":15},"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","两艘船的装载问题用回溯法求解()",[18,23,32,41,50,59,68,77,84,93],{"answer":19,"createTime":5,"id":6,"options":20,"question":16,"source":21,"type":22},[],[8,9,10,11],"v1",0,{"answer":24,"createTime":5,"id":25,"options":26,"question":31,"source":21,"type":22},[],329987930,[27,28,29,30],"贪心选择","集装箱排序","初始化数据结构","输出装载方案","采用贪心算法求解最优装载问题的主要计算量在于()",{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":21,"type":22},[],329987932,[36,37,38,39],"广度优先分支限界法与深度优先分支限界法","队列式(FIFO)分支限界法与堆栈式分支限界法","排列树法与子集树法","队列式(FIFO)分支限界法与优先队列式分支限界法","常见的两种分支限界法为()",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":21,"type":22},[],329987934,[45,46,47,48],"最优子结构","贪心选择性质","构造最优解","构造最优解D.定义最优解","贪心算法与动态规划算法的主要区别是",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":21,"type":22},[],329987936,[54,55,56,57],"选择当前价值最大的箱子","选择当前重量最重的箱子","选择当前价值最小的箱子","选择当前重量最轻的箱子","最优装载问题的贪心策略是",{"answer":60,"createTime":5,"id":61,"options":62,"question":67,"source":21,"type":22},[],329987938,[63,64,65,66],"子集树","排列树","深度优先生成树","广度优先生成树","分支限界法解旅行商问题时的解空间树是()",{"answer":69,"createTime":5,"id":70,"options":71,"question":76,"source":21,"type":22},[],329987940,[72,73,74,75],"对每一个子问题只需求解一次并保存解,当再次遇到此子问题时,只需调用此解","对每一个子问题必须求解一次不保存解,当再次遇到此子问题时,还需再次求解","对每一个子问题只求解这次需使用的解,当再次遇到此子问题时,还需再次求解","对每一个子问题不需求解一次更不保存,当再次遇到此子问题时,再来进行求解","在动态规划算法中,关于重叠子问题的处理方法是",{"answer":78,"createTime":5,"id":79,"options":80,"question":83,"source":21,"type":22},[],329987942,[64,63,81,82],"n叉树","随问题而动态变化的树","批处理作业调度问题的解空间树为",{"answer":85,"createTime":5,"id":86,"options":87,"question":92,"source":21,"type":22},[],329987944,[88,89,90,91],"线性表以顺序方式存储,并且按关键码值排好序","线性表以链式方式存储,并且按关键码值排好序","线性表以顺序方式存储,并且按关键码的检索频率排好序","线性表以链式方式存储,并且按关键码的检索频率排好序","线性表进行二分查找法查找,其前提条件是()",{"answer":94,"createTime":5,"id":95,"options":96,"question":101,"source":21,"type":22},[],329987946,[97,98,99,100],"整数规划的最优值等于其线性规划的最优值","整数规划的最优值小于等于其线性规划的最优值","没法比较","整数规划的最优值大于等于其线性规划的最优值","求解最大值问题时,整数规划的最优值与其对应的线性规划的最优值之间的关系是"]