动态规划算法的c++实现 能实现两序列的比对

[{"title":"（ 17 个子文件 272KB ） 动态规划算法的c++实现 能实现两序列的比对","children":[{"title":"hw","children":[{"title":"h.txt <span style='color:#111;'> 11B </span>","children":null,"spread":false},{"title":"hw.ncb <span style='color:#111;'> 41.00KB </span>","children":null,"spread":false},{"title":"hw.dsp <span style='color:#111;'> 4.14KB </span>","children":null,"spread":false},{"title":"m.txt <span style='color:#111;'> 7B </span>","children":null,"spread":false},{"title":"Debug","children":[{"title":"hw.pch <span style='color:#111;'> 248.90KB </span>","children":null,"spread":false},{"title":"hw.exe <span style='color:#111;'> 208.04KB </span>","children":null,"spread":false},{"title":"vc60.pdb <span style='color:#111;'> 100.00KB </span>","children":null,"spread":false},{"title":"homework.obj.enc <span style='color:#111;'> 12.26KB </span>","children":null,"spread":false},{"title":"vc60.idb <span style='color:#111;'> 81.00KB </span>","children":null,"spread":false},{"title":"hw.ilk <span style='color:#111;'> 305.29KB </span>","children":null,"spread":false},{"title":"hw.opt <span style='color:#111;'> 42.50KB </span>","children":null,"spread":false},{"title":"hw.pdb <span style='color:#111;'> 513.00KB </span>","children":null,"spread":false},{"title":"homework.obj <span style='color:#111;'> 13.92KB </span>","children":null,"spread":false}],"spread":true},{"title":"hw.plg <span style='color:#111;'> 1.21KB </span>","children":null,"spread":false},{"title":"hw.dsw <span style='color:#111;'> 527B </span>","children":null,"spread":false},{"title":"hw.opt <span style='color:#111;'> 49.50KB </span>","children":null,"spread":false},{"title":"homework.cpp <span style='color:#111;'> 4.03KB </span>","children":null,"spread":false}],"spread":true}],"spread":true}]