[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fk20IdSh6Ia5XNh0hJWBjH0tQRZbtxSq0Ed92eGngZZY":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2025-12-24 08:09:43",283672672,[8,9,10,11],"22","23","25","26",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},148,"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","work_49344529","动态规划","在0-1背包问题中,若背包容量为 20,5 个物品重量分别为\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fc12209b180bc0422f8453501b1c11976.png\">,价格分别为\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F0abce9e9281a513c726e936122787f72.png\">,则该背包能容纳物品的最大价值为( )",[21,32,41,50,59,62,71,80,89,99],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],283672663,[25,26,27,28],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F6b39cb35fc343c9f6e128c9687d3b51e.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fbd429e46412744b439a4020b592b5c9a.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F7c5e15e7ffb3fa8e8b5a991f6dac89e0.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F981f64b4773fe744fee1107552ce5370.png\">","在最长公共子序列问题中,我们用C[i,j]表示序列X[1...i]和Y[1...j]的最长公共子序列的长度,则状态转移方程应为___________","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],283672666,[36,37,38,39],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F494c4583a4141b67405b98db538e9f6d.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F3b518ed87b564d639e5e9ee0fb8ceadf.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fb70f5170a5a57ea902cf2748e7b2688b.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F3e60d9355f17b53c363d5da2cf7a84c1.png\">","给出最长公共子序列问题的部分伪码如下,其中空白处应填_________ 输入:两个序列X,Y 输出:X,Y的最长公共子序列 n,m分别代表X,Y的序列长度 \u002F\u002F初始化 新建二维数组\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fb7f654f2c2968e6d7d6a0b075823e627.png\">,\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fbaba4344fa2bd58cde3cb0c4f31d0796.png\"> \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fe2281cc6f08c50b2a1ea9d221c8c1f66.png\">",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],283672668,[45,46,47,48],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F043cb36941ccf49e43e7844e8da803bd.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F1f631ca4a999a1e9ef615704fbebf50b.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F438eaddd2645a77d5063876b91316367.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fae28fc6dde1966cb3d5dcba1e02d3a6e.png\">","0-1背包问题中的状态转移方程为___________",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":30,"type":31},[],283672669,[54,55,56,57],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F5e86461e66c87b7d9f5b8e9b81d83d01.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F871fe88dc07c063c4a84eaea6a02ec44.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F3fe22e88f3679e7a5019622765e9cd23.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fceaae11fa04a0c8dc147651daef7bf52.png\">","下面给出了0-1背包问题的动态规划算法伪码,其中空白处应分别填入___________ 输入:商品数量n,各商品价值p,各商品重量v,背包容量C 输出:最大价值,最优解决方案 创建二维数组 \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F1c3949920072364189a1d12dc30a7c5c.png\">,\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fdc112619cddea98dbc2072c61252e5df.png\"> \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F9298869ee929e15214f4a41e29e82660.png\">",{"answer":60,"createTime":5,"id":6,"options":61,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":63,"createTime":5,"id":64,"options":65,"question":70,"source":30,"type":31},[],283672675,[66,67,68,69],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F57a4d774d4b19e4837e3f43b97600093.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F343377d40dbd058b6eab32e6c3a97e8d.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F74bd70ff3ab64f410a70a3e049206082.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fd08754626f64af8f5c49aba44cd4b614.png\">","在钢条切割问题中,C[j]表示切割长度为 j 的钢条可得最大总收益,p[j]表示长度为 j 的钢条的价格,则状态转移方程为_________",{"answer":72,"createTime":5,"id":73,"options":74,"question":79,"source":30,"type":31},[],283672677,[75,76,77,78],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fca9337898d1b33599a91f46d50ebae55.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F3879e26d9679e549dc18f1ade0ad694c.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F6ccd1e7fd23f4c42dc762f9859506d49.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F796e4caa7eff2a5fc65476cf06892ca9.png\">","下面给出了钢条切割问题的动态规划算法的部分伪码,其中空白处应分别填入_____________. 输入:钢条价格表\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fbcc902f6ee31b7921852e369775fc7b6.png\">,钢条长度 输出:最大收益\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fa0cc4d8f137221253bde3767e0ca5067.png\">,钢条切割方案 \u002F\u002F初始化 创建一维数组\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fdd2b105ffed16e73b9b8e99838f6e984.png\">,\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F15d7bc60ff31658efe6bec7bc5d57b8f.png\"> \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F0e6ef4b1d3bf40675da5ed6e14f8189d.png\"> 输出最优方案 return C[n]",{"answer":81,"createTime":5,"id":82,"options":83,"question":88,"source":30,"type":31},[],283672680,[84,85,86,87],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fcf3d0240273e15c56258092b1b674f25.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F8febc18ba5ea9516beb386005c1bd0ad.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F15d77c6fe06e7a41940bc2e3cb7c5e9b.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fffc0138c582adef1d91773f323152df4.png\">","对于包含n个正数元素的数组A[1...n],我们希望找出数组中的一些元素,使得这些元素在数组中互不相邻并且元素之和最大.例如在数组[1, 8, 6, 3, 6]中,应当选择A[2]和A[5],元素之和为14.给出该问题的解决算法如下,空白处应填入_________ 输入:正数数组A,元素个数n 输出:选择的元素,最大不相邻元素之和 创建数组s[1...n],s[i]表示数组A[1...i]中的最大不相邻元素之和 创建数组Rec[1...n]记录选择方案 \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F25c63ab108739c5be5f396176c65cf7c.png\">",{"answer":90,"createTime":91,"id":92,"options":93,"question":98,"source":30,"type":31},[],"2025-12-28 02:01:33",289928842,[94,95,96,97],"《自然辩证法》","《共产党宣言》","《神圣家族》","《资本论》","1848年2月,( B )的发表,标志着马克思主义的公开问世",{"answer":100,"createTime":91,"id":101,"options":102,"question":103,"source":30,"type":31},[],289928844,[94,95,96,97],"1848年2月,( )的发表,标志着马克思主义的公开问世"]