[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fVwcXK2gxK0wksBKaQxrqliUotWu6BH8ik0G-hEvCKbY":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":27,"type":28},[],"2024-11-26 01:03:16",162084532,[8,9,10,11],"动态规划法","贪心法","分支界限法","回溯法",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},36,"54298e892f88ff0fd41d9ddd78c5ee79","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F30beff31ca123ccd6c5487d77b4daf07.png","算法基础B","work_36609975","第三章 动态规划法","矩阵连乘问题的算法可由()设计实现",[21,29,38,47,56,62,71,80,86,94],{"answer":22,"createTime":5,"id":23,"options":24,"question":26,"source":27,"type":28},[],162084508,[9,11,25,8],"备忘录法","下列算法中通常以自底向上的方式求解最优解的是()","v1",0,{"answer":30,"createTime":5,"id":31,"options":32,"question":37,"source":27,"type":28},[],162084509,[33,34,35,36],"O(nlogn)","O(2 n)","O(n 2)","O(n 3)","用动态规划算法实现矩阵连乘问题所需要的时间复杂度为()",{"answer":39,"createTime":5,"id":40,"options":41,"question":46,"source":27,"type":28},[],162084510,[42,43,44,45],"子问题重叠性质","定义最优解","算出最优解","构造最优解","下列是动态规划算法基本要素的是()",{"answer":48,"createTime":5,"id":49,"options":50,"question":55,"source":27,"type":28},[],162084511,[51,52,53,54],"使用动态规划必须满足无后效性的原则","动态规划只能倒推求解","动态规划的指标函数要满足可分离性、单调性、递推性","动态规划可求解多阶段优化问题","以下关于动态规划的陈述中不正确的是()",{"answer":57,"createTime":5,"id":58,"options":59,"question":61,"source":27,"type":28},[],162084513,[35,34,33,60],"O(n)","用动态规划算法实现最大子段和所需要的时间复杂度为()",{"answer":63,"createTime":5,"id":64,"options":65,"question":70,"source":27,"type":28},[],162084515,[66,67,68,69],"状态是由决策确定的","列表法是求解某些离散变量动态规划问题的有效方法","用逆序法求解动态规划问题的重要基础之一是最优性原理","动态规划阶段的顺序与求解过程无关","关于动态规划问题的下列命题中错误的是()",{"answer":72,"createTime":5,"id":73,"options":74,"question":79,"source":27,"type":28},[],162084519,[75,76,77,78],"n乘以C和n乘以C","n和n<br>","n和n的平方","n的平方和n","用动态规划算法实现0-1背包问题所需要的时间复杂度和空间复杂度分别____和____",{"answer":81,"createTime":5,"id":82,"options":83,"question":85,"source":27,"type":28},[],162084524,[36,60,84,35],"O(n 4)","用动态规划算法实现矩阵连乘问题所需要的空间复杂度为()",{"answer":87,"createTime":5,"id":88,"options":89,"question":93,"source":27,"type":28},[],162084528,[90,91,92,43],"重叠子问题","最优子结构性质","贪心选择性质","一个问题可用动态规划算法或贪心算法求解的关键特征是问题的()",{"answer":95,"createTime":5,"id":6,"options":96,"question":19,"source":27,"type":28},[],[8,9,10,11]]