动态规划0-1背包的改进算法java代码(共2页).doc

精选优质文档-倾情为你奉上import java.lang.*;import java.io.*;public class Siyu public static void Traceback(int n,int w,int v,int p,int head,int x) int j=phead0-10,m=phead0-11; for (int i=1;i=n;i+) xi=0; for (int k=headi+1;k=headi-1;k+) if (pk0+wi=j&pk1+vi=m) xi=1;j=pk0;m=pk1;break; public static int knapsack(int n,int c,int v,int w,int p,int x)/pi0表示跳跃点的j值，p