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