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