分支限界算法之0-1背包问题和单源最短路径问题java源程序.doc

实验报告13
课程 数据结构与算法 实验名称 分支限界法 第 页
班级 11计本 学号 105032011130 姓名 风律澈
实验日期：2013年6月3日 报告退发 (订正 、 重做)
一、实验目的
掌握分支限界法的原理和应用。
二、实验环境
1、微型计算机一台
2、WINDOWS操作系统，Java SDK，Eclipse开发环境
三、实验内容
必做题：
1、 编写程序，采用分支限界法求解单元最短路径问题。
2、 编写程序，采用分支限界发法实现0-1背包问题。
四、实验步骤和结果
(附上代码和程序运行结果截图)
1,单源最短路径
import java.util.PriorityQueue;

public class BBShortest {

/**
* @param args
*/
static class HeapNode implements Comparable{
int i;//顶点编号
int length;

HeapNode(int ii,int ll){//构造函数，类种类
i=ii;
length=ll;
}
@Override
public int compareTo(Object o) {//为优先队列设置优先级判定方法
// TODO Auto-generated method stub
int x=((HeapNode)o).length;
if(lengthnt v,int []dist,int []p){
int n=p.length-1;
PriorityQueue heap=new PriorityQueue();//生成一个优先队列存放活节点
HeapNode enode=new HeapNode(v,0);
for(int j=1;j<=n;j++)
dist[j]=Integer.MAX_VALUE;//默认每个顶点初始都是最长距离
dist[v]=0;

while(true){
for(int j=1;j<=n;j++)
if(a[enode.i][j]reak;
else
enode=heap.poll();
}
}
public static void main(String[] args) {
// TODO Auto-generated method stub
int M=Integer.MAX_VALUE;
a=new int[][]{
{M,M,M,M,M,M},
{M,0,10,M,30,100},
{M,M,0,50,M,M},
{M,M,M,0,M,10},
{M,M,M,20,0,60},
{M,M,M,M,M,0}
};
int v = 1;
int dist[]=new int[a.length];
int p[]=new int[a.length];
shortest(v,dist,p);
for(int i=1;i
2，0-1背包问题
package bag01b;

import java.util.ArrayList;

public class bag01do {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
ArrayList objects=new ArrayList<>();
objects.add(new object(3,9));
objects.add(new object(5,10));
objects.add(new object(2,7));
objects.add(new object(1,4));
bag b=new bag(7,objects);
b.findmaxvalue();
b.show();
}

}
-------------------------------------------10、
package bag01b;

import java.util.ArrayList;
import java.util.Collections;
import java.util.PriorityQueue;

public class bag {
private int bagv;
private ArrayList objects;
private int maxvalue;
private ArrayList result_objec11、ts;

public bag(int v,ArrayList o){
super();
this.bagv=v;
this.objects=o;
this.maxvalue=0;
this.result_objects=null;
Collections.sort(objects);
}

public void show(){
System.out.println("maxvalue :"+ this.maxvalue12、);
System.out.println("the object when maxvalue:"+this.result_objects);
}

public void findmaxvalue(){
PriorityQueue enode=new PriorityQueue<>();
Node node=new Node(0,null,bagv,this.objects);
enode.offer(node);
while(true){
if(enode13、isEmpty())
break;
node=enode.poll();
if(node.isend()){
this.maxvalue=node.get_bag_value();
this.result_objects=new ArrayList<>(node.get_in_bag_object());
return;
}
int i=node.get_node_in();
object iobject=this.objects.get(i14、);
if(node.get_bag_weight()+iobject.getweight()<=this.bagv){
ArrayList newnodeinbag=new ArrayList(node.get_in_bag_object());
newnodeinbag.add(iobject);
int newnodebagv=node.get_bag_leftv()-iobject.getweight();
Node newnode=new Node(i+1,newn15、odeinbag,newnodebagv,this.objects);
enode.add(newnode);
if(newnode.get_bag_value()>this.maxvalue){
this.maxvalue=newnode.get_bag_value();
this.result_objects=new ArrayList<>(newnode.get_in_bag_object());
}
}
Node newnode=new Node(i+1,nod16、e.get_in_bag_object(),node.get_bag_leftv(),this.objects);
if(newnode.get_bag_prio()>this.maxvalue)
enode.add(newnode);
}
}
}
-----------------------------------------------------------------------
package bag01b;

import java.util.ArrayList;

public class Node im17、plements Comparable{
private int node_in;
private ArrayList inbag_object;
private ArrayList outbag_object;
private int leftv;
private int prio;
public Node(int i,ArrayList in,int l,ArrayList out){
super();
this.node_in=i;
if(in==null)
in18、new ArrayList<>();
this.inbag_object=in;
this.leftv=l;
this.outbag_object=out;
this.prio=this.find_prio();

}
private int find_prio() {
// TODO Auto-generated method stub
int bag_left=this.leftv;
int p=this.get_bag_value();

int i=this.node_in;
object iobject=nu19、ll;
while(true){
if(i>=this.inbag_object.size())
break;
iobject=this.inbag_object.get(i);
if(iobject.getweight()>bag_left)
break;
bag_left-=iobject.getweight();
p+=iobject.getvalue();
i++;
}
if(i<=this.inbag_object.size()-1)
p+=iobject.getvw()*bag_left;20、
return p;
}
public int get_bag_weight(){
int w=0;
for(object o:this.inbag_object){
w+=o.getweight();
}
return w;
}
public int get_bag_value(){
int w=0;
for(object o:this.inbag_object){
w+=o.getvalue();
}
return w;
}
@Override
public int compareTo(Nod21、e o) {
// TODO Auto-generated method stub
if(this.prio>o.prio) return -1;
if(this.prio get_in_bag_object(){
22、 return this.inbag_object;
}
public int get_node_in(){return this.node_in;}
public int get_bag_leftv(){return this.leftv;}
public int get_bag_prio(){return this.prio;}
public String toString(){
return "node in"+this.node_in+"node prio"+this.prio;
}
}
-------------------------------23、
package bag01b;

public class object implements Comparable{
private static int ids=1;
private int id;
private int weihgt;
private int value;
public object(int w,int v){
super();
this.weihgt=w;
this.value=v;
this.id=ids++;
}
24、
public int getid(){return this.id;}
public int getweight(){return this.weihgt;}
public int getvalue(){return this.value;}
public float getvw(){return (float)this.value/this.weihgt;}
@Override
public int compareTo(object o) {
// TODO Auto-generated method stub
if(this.getvw()>o.getvw()) return -1;
if(this.getvw()

var _hmt = _hmt || [];
(function() {
var hm = document.createElement("script");
hm.src = "https://hm.baidu.com/hm.js?6e2a21bc68316db308b5fdc9a0d11f2e";
var s = document.getElementsByTagName("script")[0];
s.parentNode.insertBefore(hm, s);
})();

关于我们      便捷服务       自信AI       AI导航        抽奖活动©2010-2026 宁波自信网络信息技术有限公司  版权所有客服电话：[phone]  投诉电话：[phone]浙公网安备33021202000488号   浙ICP备2021020529号-1  |  浙B2-20240490  关注我们 ：             

登录

首页

分类

学堂

公告

帮助中心

function stopPropagation(e) {
var ev = e || window.event;
if (ev.stopPropagation) {
ev.stopPropagation();
}
else if (window.event) {
window.event.cancelBubble = true;//兼容IE
}
}
$("#navmore").click(function (e) {
$("#navcontent").show();
$("#navlogo").show();
stopPropagation(e);
var navcontentwidth = $("#navcontent").width();
$('#navcontent').css({ 'right': '-' + navcontentwidth + 'px' });
$("#navcontent").show().animate({ "right": 0 }, 300);
});
$(document).bind('click', function () {
var navcontentwidth = $("#navcontent").width();
$("#navcontent").animate({ 'right': '-' + navcontentwidth + 'px' }, 300, function () { $("#navcontent").hide(); });
$("#navlogo").fadeOut(300);
});
$("#navcontent").click(function (e) {
stopPropagation(e);
});
$("#navclose").click(function (e) {
var navcontentwidth = $("#navcontent").width();
$("#navcontent").animate({ 'right': '-' + navcontentwidth + 'px' }, 300, function () { $("#navcontent").hide(); });
$("#navlogo").fadeOut(300);
});

function BaseShare(title, desc, link, imgUrl) {}

首页

分类

专题

我的

$(document).ready(function () {
var arr = $(".headercontent");
for (var i = 0; i < arr.length; i++) {
(function (index) {
var url = "https://m.zixin.com.cn/header.aspx";
$.get(url + "?tp=0&t=" + (new Date()).valueOf(), function (d) {
try {
arr.eq(index).empty().html(d);
} catch (e) { }
try {
arr.html(d);
} catch (e) { }
});
})(i);
}
});

$("img.lazys").lazyload({
threshold: 200,
effect: "fadeIn"
});

package bag01b;

import java.util.ArrayList;
import java.util.Collections;
import java.util.PriorityQueue;

public class bag {
private int bagv;
private ArrayList objects;
private int maxvalue;
private ArrayList result_objec11、ts;

public bag(int v,ArrayList o){
super();
this.bagv=v;
this.objects=o;
this.maxvalue=0;
this.result_objects=null;
Collections.sort(objects);
}

public void show(){
System.out.println("maxvalue :"+ this.maxvalue12、);
System.out.println("the object when maxvalue:"+this.result_objects);
}

public void findmaxvalue(){
PriorityQueue enode=new PriorityQueue<>();
Node node=new Node(0,null,bagv,this.objects);
enode.offer(node);
while(true){
if(enode13、isEmpty())
break;
node=enode.poll();
if(node.isend()){
this.maxvalue=node.get_bag_value();
this.result_objects=new ArrayList<>(node.get_in_bag_object());
return;
}
int i=node.get_node_in();
object iobject=this.objects.get(i14、);
if(node.get_bag_weight()+iobject.getweight()<=this.bagv){
ArrayList newnodeinbag=new ArrayList(node.get_in_bag_object());
newnodeinbag.add(iobject);
int newnodebagv=node.get_bag_leftv()-iobject.getweight();
Node newnode=new Node(i+1,newn15、odeinbag,newnodebagv,this.objects);
enode.add(newnode);
if(newnode.get_bag_value()>this.maxvalue){
this.maxvalue=newnode.get_bag_value();
this.result_objects=new ArrayList<>(newnode.get_in_bag_object());
}
}
Node newnode=new Node(i+1,nod16、e.get_in_bag_object(),node.get_bag_leftv(),this.objects);
if(newnode.get_bag_prio()>this.maxvalue)
enode.add(newnode);
}
}
}
-----------------------------------------------------------------------
package bag01b;

import java.util.ArrayList;

public class Node im17、plements Comparable{
private int node_in;
private ArrayList inbag_object;
private ArrayList outbag_object;
private int leftv;
private int prio;
public Node(int i,ArrayList in,int l,ArrayList out){
super();
this.node_in=i;
if(in==null)
in18、new ArrayList<>();
this.inbag_object=in;
this.leftv=l;
this.outbag_object=out;
this.prio=this.find_prio();

}
private int find_prio() {
// TODO Auto-generated method stub
int bag_left=this.leftv;
int p=this.get_bag_value();

int i=this.node_in;
object iobject=nu19、ll;
while(true){
if(i>=this.inbag_object.size())
break;
iobject=this.inbag_object.get(i);
if(iobject.getweight()>bag_left)
break;
bag_left-=iobject.getweight();
p+=iobject.getvalue();
i++;
}
if(i<=this.inbag_object.size()-1)
p+=iobject.getvw()*bag_left;20、
return p;
}
public int get_bag_weight(){
int w=0;
for(object o:this.inbag_object){
w+=o.getweight();
}
return w;
}
public int get_bag_value(){
int w=0;
for(object o:this.inbag_object){
w+=o.getvalue();
}
return w;
}
@Override
public int compareTo(Nod21、e o) {
// TODO Auto-generated method stub
if(this.prio>o.prio) return -1;
if(this.prio get_in_bag_object(){
22、 return this.inbag_object;
}
public int get_node_in(){return this.node_in;}
public int get_bag_leftv(){return this.leftv;}
public int get_bag_prio(){return this.prio;}
public String toString(){
return "node in"+this.node_in+"node prio"+this.prio;
}
}
-------------------------------23、
package bag01b;

public class object implements Comparable{
private static int ids=1;
private int id;
private int weihgt;
private int value;
public object(int w,int v){
super();
this.weihgt=w;
this.value=v;
this.id=ids++;
}
24、
public int getid(){return this.id;}
public int getweight(){return this.weihgt;}
public int getvalue(){return this.value;}
public float getvw(){return (float)this.value/this.weihgt;}
@Override
public int compareTo(object o) {
// TODO Auto-generated method stub
if(this.getvw()>o.getvw()) return -1;
if(this.getvw()

var _hmt = _hmt || [];
(function() {
var hm = document.createElement("script");
hm.src = "https://hm.baidu.com/hm.js?6e2a21bc68316db308b5fdc9a0d11f2e";
var s = document.getElementsByTagName("script")[0];
s.parentNode.insertBefore(hm, s);
})();

关于我们      便捷服务       自信AI       AI导航        抽奖活动©2010-2026 宁波自信网络信息技术有限公司  版权所有客服电话：[phone]  投诉电话：[phone]浙公网安备33021202000488号   浙ICP备2021020529号-1  |  浙B2-20240490  关注我们 ：             

登录

首页

分类

学堂

公告

帮助中心

function stopPropagation(e) {
var ev = e || window.event;
if (ev.stopPropagation) {
ev.stopPropagation();
}
else if (window.event) {
window.event.cancelBubble = true;//兼容IE
}
}
$("#navmore").click(function (e) {
$("#navcontent").show();
$("#navlogo").show();
stopPropagation(e);
var navcontentwidth = $("#navcontent").width();
$('#navcontent').css({ 'right': '-' + navcontentwidth + 'px' });
$("#navcontent").show().animate({ "right": 0 }, 300);
});
$(document).bind('click', function () {
var navcontentwidth = $("#navcontent").width();
$("#navcontent").animate({ 'right': '-' + navcontentwidth + 'px' }, 300, function () { $("#navcontent").hide(); });
$("#navlogo").fadeOut(300);
});
$("#navcontent").click(function (e) {
stopPropagation(e);
});
$("#navclose").click(function (e) {
var navcontentwidth = $("#navcontent").width();
$("#navcontent").animate({ 'right': '-' + navcontentwidth + 'px' }, 300, function () { $("#navcontent").hide(); });
$("#navlogo").fadeOut(300);
});

function BaseShare(title, desc, link, imgUrl) {}

首页

分类

专题

我的

$(document).ready(function () {
var arr = $(".headercontent");
for (var i = 0; i < arr.length; i++) {
(function (index) {
var url = "https://m.zixin.com.cn/header.aspx";
$.get(url + "?tp=0&t=" + (new Date()).valueOf(), function (d) {
try {
arr.eq(index).empty().html(d);
} catch (e) { }
try {
arr.html(d);
} catch (e) { }
});
})(i);
}
});

$("img.lazys").lazyload({
threshold: 200,
effect: "fadeIn"
});

ts;

public bag(int v,ArrayList o){
super();
this.bagv=v;
this.objects=o;
this.maxvalue=0;
this.result_objects=null;
Collections.sort(objects);
}

public void show(){
System.out.println("maxvalue :"+ this.maxvalue12、);
System.out.println("the object when maxvalue:"+this.result_objects);
}

public void findmaxvalue(){
PriorityQueue enode=new PriorityQueue<>();
Node node=new Node(0,null,bagv,this.objects);
enode.offer(node);
while(true){
if(enode13、isEmpty())
break;
node=enode.poll();
if(node.isend()){
this.maxvalue=node.get_bag_value();
this.result_objects=new ArrayList<>(node.get_in_bag_object());
return;
}
int i=node.get_node_in();
object iobject=this.objects.get(i14、);
if(node.get_bag_weight()+iobject.getweight()<=this.bagv){
ArrayList newnodeinbag=new ArrayList(node.get_in_bag_object());
newnodeinbag.add(iobject);
int newnodebagv=node.get_bag_leftv()-iobject.getweight();
Node newnode=new Node(i+1,newn15、odeinbag,newnodebagv,this.objects);
enode.add(newnode);
if(newnode.get_bag_value()>this.maxvalue){
this.maxvalue=newnode.get_bag_value();
this.result_objects=new ArrayList<>(newnode.get_in_bag_object());
}
}
Node newnode=new Node(i+1,nod16、e.get_in_bag_object(),node.get_bag_leftv(),this.objects);
if(newnode.get_bag_prio()>this.maxvalue)
enode.add(newnode);
}
}
}
-----------------------------------------------------------------------
package bag01b;

import java.util.ArrayList;

public class Node im17、plements Comparable{
private int node_in;
private ArrayList inbag_object;
private ArrayList outbag_object;
private int leftv;
private int prio;
public Node(int i,ArrayList in,int l,ArrayList out){
super();
this.node_in=i;
if(in==null)
in18、new ArrayList<>();
this.inbag_object=in;
this.leftv=l;
this.outbag_object=out;
this.prio=this.find_prio();

}
private int find_prio() {
// TODO Auto-generated method stub
int bag_left=this.leftv;
int p=this.get_bag_value();

int i=this.node_in;
object iobject=nu19、ll;
while(true){
if(i>=this.inbag_object.size())
break;
iobject=this.inbag_object.get(i);
if(iobject.getweight()>bag_left)
break;
bag_left-=iobject.getweight();
p+=iobject.getvalue();
i++;
}
if(i<=this.inbag_object.size()-1)
p+=iobject.getvw()*bag_left;20、
return p;
}
public int get_bag_weight(){
int w=0;
for(object o:this.inbag_object){
w+=o.getweight();
}
return w;
}
public int get_bag_value(){
int w=0;
for(object o:this.inbag_object){
w+=o.getvalue();
}
return w;
}
@Override
public int compareTo(Nod21、e o) {
// TODO Auto-generated method stub
if(this.prio>o.prio) return -1;
if(this.prio get_in_bag_object(){
22、 return this.inbag_object;
}
public int get_node_in(){return this.node_in;}
public int get_bag_leftv(){return this.leftv;}
public int get_bag_prio(){return this.prio;}
public String toString(){
return "node in"+this.node_in+"node prio"+this.prio;
}
}
-------------------------------23、
package bag01b;

public class object implements Comparable{
private static int ids=1;
private int id;
private int weihgt;
private int value;
public object(int w,int v){
super();
this.weihgt=w;
this.value=v;
this.id=ids++;
}
24、
public int getid(){return this.id;}
public int getweight(){return this.weihgt;}
public int getvalue(){return this.value;}
public float getvw(){return (float)this.value/this.weihgt;}
@Override
public int compareTo(object o) {
// TODO Auto-generated method stub
if(this.getvw()>o.getvw()) return -1;
if(this.getvw()

var _hmt = _hmt || [];
(function() {
var hm = document.createElement("script");
hm.src = "https://hm.baidu.com/hm.js?6e2a21bc68316db308b5fdc9a0d11f2e";
var s = document.getElementsByTagName("script")[0];
s.parentNode.insertBefore(hm, s);
})();

关于我们      便捷服务       自信AI       AI导航        抽奖活动©2010-2026 宁波自信网络信息技术有限公司  版权所有客服电话：[phone]  投诉电话：[phone]浙公网安备33021202000488号   浙ICP备2021020529号-1  |  浙B2-20240490  关注我们 ：             

登录

首页

分类

学堂

公告

帮助中心

function stopPropagation(e) {
var ev = e || window.event;
if (ev.stopPropagation) {
ev.stopPropagation();
}
else if (window.event) {
window.event.cancelBubble = true;//兼容IE
}
}
$("#navmore").click(function (e) {
$("#navcontent").show();
$("#navlogo").show();
stopPropagation(e);
var navcontentwidth = $("#navcontent").width();
$('#navcontent').css({ 'right': '-' + navcontentwidth + 'px' });
$("#navcontent").show().animate({ "right": 0 }, 300);
});
$(document).bind('click', function () {
var navcontentwidth = $("#navcontent").width();
$("#navcontent").animate({ 'right': '-' + navcontentwidth + 'px' }, 300, function () { $("#navcontent").hide(); });
$("#navlogo").fadeOut(300);
});
$("#navcontent").click(function (e) {
stopPropagation(e);
});
$("#navclose").click(function (e) {
var navcontentwidth = $("#navcontent").width();
$("#navcontent").animate({ 'right': '-' + navcontentwidth + 'px' }, 300, function () { $("#navcontent").hide(); });
$("#navlogo").fadeOut(300);
});

function BaseShare(title, desc, link, imgUrl) {}

首页

分类

专题

我的

$(document).ready(function () {
var arr = $(".headercontent");
for (var i = 0; i < arr.length; i++) {
(function (index) {
var url = "https://m.zixin.com.cn/header.aspx";
$.get(url + "?tp=0&t=" + (new Date()).valueOf(), function (d) {
try {
arr.eq(index).empty().html(d);
} catch (e) { }
try {
arr.html(d);
} catch (e) { }
});
})(i);
}
});

$("img.lazys").lazyload({
threshold: 200,
effect: "fadeIn"
});

);
System.out.println("the object when maxvalue:"+this.result_objects);
}

public void findmaxvalue(){
PriorityQueue enode=new PriorityQueue<>();
Node node=new Node(0,null,bagv,this.objects);
enode.offer(node);
while(true){
if(enodeisEmpty())
break;
node=enode.poll();
if(node.isend()){
this.maxvalue=node.get_bag_value();
this.result_objects=new ArrayList<>(node.get_in_bag_object());
return;
}
int i=node.get_node_in();
object iobject=this.objects.get(i);
if(node.get_bag_weight()+iobject.getweight()<=this.bagv){
ArrayList newnodeinbag=new ArrayList(node.get_in_bag_object());
newnodeinbag.add(iobject);
int newnodebagv=node.get_bag_leftv()-iobject.getweight();
Node newnode=new Node(i+1,newn15、odeinbag,newnodebagv,this.objects);
enode.add(newnode);
if(newnode.get_bag_value()>this.maxvalue){
this.maxvalue=newnode.get_bag_value();
this.result_objects=new ArrayList<>(newnode.get_in_bag_object());
}
}
Node newnode=new Node(i+1,nod16、e.get_in_bag_object(),node.get_bag_leftv(),this.objects);
if(newnode.get_bag_prio()>this.maxvalue)
enode.add(newnode);
}
}
}
-----------------------------------------------------------------------
package bag01b;

import java.util.ArrayList;

public class Node im17、plements Comparable{
private int node_in;
private ArrayList inbag_object;
private ArrayList outbag_object;
private int leftv;
private int prio;
public Node(int i,ArrayList in,int l,ArrayList out){
super();
this.node_in=i;
if(in==null)
in18、new ArrayList<>();
this.inbag_object=in;
this.leftv=l;
this.outbag_object=out;
this.prio=this.find_prio();

}
private int find_prio() {
// TODO Auto-generated method stub
int bag_left=this.leftv;
int p=this.get_bag_value();

int i=this.node_in;
object iobject=nu19、ll;
while(true){
if(i>=this.inbag_object.size())
break;
iobject=this.inbag_object.get(i);
if(iobject.getweight()>bag_left)
break;
bag_left-=iobject.getweight();
p+=iobject.getvalue();
i++;
}
if(i<=this.inbag_object.size()-1)
p+=iobject.getvw()*bag_left;20、
return p;
}
public int get_bag_weight(){
int w=0;
for(object o:this.inbag_object){
w+=o.getweight();
}
return w;
}
public int get_bag_value(){
int w=0;
for(object o:this.inbag_object){
w+=o.getvalue();
}
return w;
}
@Override
public int compareTo(Nod21、e o) {
// TODO Auto-generated method stub
if(this.prio>o.prio) return -1;
if(this.prio get_in_bag_object(){
22、 return this.inbag_object;
}
public int get_node_in(){return this.node_in;}
public int get_bag_leftv(){return this.leftv;}
public int get_bag_prio(){return this.prio;}
public String toString(){
return "node in"+this.node_in+"node prio"+this.prio;
}
}
-------------------------------23、
package bag01b;

public class object implements Comparable{
private static int ids=1;
private int id;
private int weihgt;
private int value;
public object(int w,int v){
super();
this.weihgt=w;
this.value=v;
this.id=ids++;
}
24、
public int getid(){return this.id;}
public int getweight(){return this.weihgt;}
public int getvalue(){return this.value;}
public float getvw(){return (float)this.value/this.weihgt;}
@Override
public int compareTo(object o) {
// TODO Auto-generated method stub
if(this.getvw()>o.getvw()) return -1;
if(this.getvw()

var _hmt = _hmt || [];
(function() {
var hm = document.createElement("script");
hm.src = "https://hm.baidu.com/hm.js?6e2a21bc68316db308b5fdc9a0d11f2e";
var s = document.getElementsByTagName("script")[0];
s.parentNode.insertBefore(hm, s);
})();

关于我们      便捷服务       自信AI       AI导航        抽奖活动©2010-2026 宁波自信网络信息技术有限公司  版权所有客服电话：[phone]  投诉电话：[phone]浙公网安备33021202000488号   浙ICP备2021020529号-1  |  浙B2-20240490  关注我们 ：             

登录

首页

分类

学堂

公告

帮助中心

function stopPropagation(e) {
var ev = e || window.event;
if (ev.stopPropagation) {
ev.stopPropagation();
}
else if (window.event) {
window.event.cancelBubble = true;//兼容IE
}
}
$("#navmore").click(function (e) {
$("#navcontent").show();
$("#navlogo").show();
stopPropagation(e);
var navcontentwidth = $("#navcontent").width();
$('#navcontent').css({ 'right': '-' + navcontentwidth + 'px' });
$("#navcontent").show().animate({ "right": 0 }, 300);
});
$(document).bind('click', function () {
var navcontentwidth = $("#navcontent").width();
$("#navcontent").animate({ 'right': '-' + navcontentwidth + 'px' }, 300, function () { $("#navcontent").hide(); });
$("#navlogo").fadeOut(300);
});
$("#navcontent").click(function (e) {
stopPropagation(e);
});
$("#navclose").click(function (e) {
var navcontentwidth = $("#navcontent").width();
$("#navcontent").animate({ 'right': '-' + navcontentwidth + 'px' }, 300, function () { $("#navcontent").hide(); });
$("#navlogo").fadeOut(300);
});

function BaseShare(title, desc, link, imgUrl) {}

首页

分类

专题

我的

$(document).ready(function () {
var arr = $(".headercontent");
for (var i = 0; i < arr.length; i++) {
(function (index) {
var url = "https://m.zixin.com.cn/header.aspx";
$.get(url + "?tp=0&t=" + (new Date()).valueOf(), function (d) {
try {
arr.eq(index).empty().html(d);
} catch (e) { }
try {
arr.html(d);
} catch (e) { }
});
})(i);
}
});

$("img.lazys").lazyload({
threshold: 200,
effect: "fadeIn"
});

odeinbag,newnodebagv,this.objects);
enode.add(newnode);
if(newnode.get_bag_value()>this.maxvalue){
this.maxvalue=newnode.get_bag_value();
this.result_objects=new ArrayList<>(newnode.get_in_bag_object());
}
}
Node newnode=new Node(i+1,node.get_in_bag_object(),node.get_bag_leftv(),this.objects);
if(newnode.get_bag_prio()>this.maxvalue)
enode.add(newnode);
}
}
}
-----------------------------------------------------------------------
package bag01b;

import java.util.ArrayList;

public class Node implements Comparable{
private int node_in;
private ArrayList inbag_object;
private ArrayList outbag_object;
private int leftv;
private int prio;
public Node(int i,ArrayList in,int l,ArrayList out){
super();
this.node_in=i;
if(in==null)
in18、new ArrayList<>();
this.inbag_object=in;
this.leftv=l;
this.outbag_object=out;
this.prio=this.find_prio();

}
private int find_prio() {
// TODO Auto-generated method stub
int bag_left=this.leftv;
int p=this.get_bag_value();

int i=this.node_in;
object iobject=nu19、ll;
while(true){
if(i>=this.inbag_object.size())
break;
iobject=this.inbag_object.get(i);
if(iobject.getweight()>bag_left)
break;
bag_left-=iobject.getweight();
p+=iobject.getvalue();
i++;
}
if(i<=this.inbag_object.size()-1)
p+=iobject.getvw()*bag_left;20、
return p;
}
public int get_bag_weight(){
int w=0;
for(object o:this.inbag_object){
w+=o.getweight();
}
return w;
}
public int get_bag_value(){
int w=0;
for(object o:this.inbag_object){
w+=o.getvalue();
}
return w;
}
@Override
public int compareTo(Nod21、e o) {
// TODO Auto-generated method stub
if(this.prio>o.prio) return -1;
if(this.prio get_in_bag_object(){
22、 return this.inbag_object;
}
public int get_node_in(){return this.node_in;}
public int get_bag_leftv(){return this.leftv;}
public int get_bag_prio(){return this.prio;}
public String toString(){
return "node in"+this.node_in+"node prio"+this.prio;
}
}
-------------------------------23、
package bag01b;

public class object implements Comparable{
private static int ids=1;
private int id;
private int weihgt;
private int value;
public object(int w,int v){
super();
this.weihgt=w;
this.value=v;
this.id=ids++;
}
24、
public int getid(){return this.id;}
public int getweight(){return this.weihgt;}
public int getvalue(){return this.value;}
public float getvw(){return (float)this.value/this.weihgt;}
@Override
public int compareTo(object o) {
// TODO Auto-generated method stub
if(this.getvw()>o.getvw()) return -1;
if(this.getvw()

var _hmt = _hmt || [];
(function() {
var hm = document.createElement("script");
hm.src = "https://hm.baidu.com/hm.js?6e2a21bc68316db308b5fdc9a0d11f2e";
var s = document.getElementsByTagName("script")[0];
s.parentNode.insertBefore(hm, s);
})();

关于我们      便捷服务       自信AI       AI导航        抽奖活动©2010-2026 宁波自信网络信息技术有限公司  版权所有客服电话：[phone]  投诉电话：[phone]浙公网安备33021202000488号   浙ICP备2021020529号-1  |  浙B2-20240490  关注我们 ：             

登录

首页

分类

学堂

公告

帮助中心

function stopPropagation(e) {
var ev = e || window.event;
if (ev.stopPropagation) {
ev.stopPropagation();
}
else if (window.event) {
window.event.cancelBubble = true;//兼容IE
}
}
$("#navmore").click(function (e) {
$("#navcontent").show();
$("#navlogo").show();
stopPropagation(e);
var navcontentwidth = $("#navcontent").width();
$('#navcontent').css({ 'right': '-' + navcontentwidth + 'px' });
$("#navcontent").show().animate({ "right": 0 }, 300);
});
$(document).bind('click', function () {
var navcontentwidth = $("#navcontent").width();
$("#navcontent").animate({ 'right': '-' + navcontentwidth + 'px' }, 300, function () { $("#navcontent").hide(); });
$("#navlogo").fadeOut(300);
});
$("#navcontent").click(function (e) {
stopPropagation(e);
});
$("#navclose").click(function (e) {
var navcontentwidth = $("#navcontent").width();
$("#navcontent").animate({ 'right': '-' + navcontentwidth + 'px' }, 300, function () { $("#navcontent").hide(); });
$("#navlogo").fadeOut(300);
});

function BaseShare(title, desc, link, imgUrl) {}

首页

分类

专题

我的

$(document).ready(function () {
var arr = $(".headercontent");
for (var i = 0; i < arr.length; i++) {
(function (index) {
var url = "https://m.zixin.com.cn/header.aspx";
$.get(url + "?tp=0&t=" + (new Date()).valueOf(), function (d) {
try {
arr.eq(index).empty().html(d);
} catch (e) { }
try {
arr.html(d);
} catch (e) { }
});
})(i);
}
});

$("img.lazys").lazyload({
threshold: 200,
effect: "fadeIn"
});

new ArrayList<>();
this.inbag_object=in;
this.leftv=l;
this.outbag_object=out;
this.prio=this.find_prio();

}
private int find_prio() {
// TODO Auto-generated method stub
int bag_left=this.leftv;
int p=this.get_bag_value();

int i=this.node_in;
object iobject=null;
while(true){
if(i>=this.inbag_object.size())
break;
iobject=this.inbag_object.get(i);
if(iobject.getweight()>bag_left)
break;
bag_left-=iobject.getweight();
p+=iobject.getvalue();
i++;
}
if(i<=this.inbag_object.size()-1)
p+=iobject.getvw()*bag_left;
return p;
}
public int get_bag_weight(){
int w=0;
for(object o:this.inbag_object){
w+=o.getweight();
}
return w;
}
public int get_bag_value(){
int w=0;
for(object o:this.inbag_object){
w+=o.getvalue();
}
return w;
}
@Override
public int compareTo(Node o) {
// TODO Auto-generated method stub
if(this.prio>o.prio) return -1;
if(this.prio get_in_bag_object(){
return this.inbag_object;
}
public int get_node_in(){return this.node_in;}
public int get_bag_leftv(){return this.leftv;}
public int get_bag_prio(){return this.prio;}
public String toString(){
return "node in"+this.node_in+"node prio"+this.prio;
}
}
-------------------------------
package bag01b;

public class object implements Comparable{
private static int ids=1;
private int id;
private int weihgt;
private int value;
public object(int w,int v){
super();
this.weihgt=w;
this.value=v;
this.id=ids++;
}
24、
public int getid(){return this.id;}
public int getweight(){return this.weihgt;}
public int getvalue(){return this.value;}
public float getvw(){return (float)this.value/this.weihgt;}
@Override
public int compareTo(object o) {
// TODO Auto-generated method stub
if(this.getvw()>o.getvw()) return -1;
if(this.getvw()

var _hmt = _hmt || [];
(function() {
var hm = document.createElement("script");
hm.src = "https://hm.baidu.com/hm.js?6e2a21bc68316db308b5fdc9a0d11f2e";
var s = document.getElementsByTagName("script")[0];
s.parentNode.insertBefore(hm, s);
})();

关于我们      便捷服务       自信AI       AI导航        抽奖活动©2010-2026 宁波自信网络信息技术有限公司  版权所有客服电话：[phone]  投诉电话：[phone]浙公网安备33021202000488号   浙ICP备2021020529号-1  |  浙B2-20240490  关注我们 ：             

登录

首页

分类

学堂

公告

帮助中心

function stopPropagation(e) {
var ev = e || window.event;
if (ev.stopPropagation) {
ev.stopPropagation();
}
else if (window.event) {
window.event.cancelBubble = true;//兼容IE
}
}
$("#navmore").click(function (e) {
$("#navcontent").show();
$("#navlogo").show();
stopPropagation(e);
var navcontentwidth = $("#navcontent").width();
$('#navcontent').css({ 'right': '-' + navcontentwidth + 'px' });
$("#navcontent").show().animate({ "right": 0 }, 300);
});
$(document).bind('click', function () {
var navcontentwidth = $("#navcontent").width();
$("#navcontent").animate({ 'right': '-' + navcontentwidth + 'px' }, 300, function () { $("#navcontent").hide(); });
$("#navlogo").fadeOut(300);
});
$("#navcontent").click(function (e) {
stopPropagation(e);
});
$("#navclose").click(function (e) {
var navcontentwidth = $("#navcontent").width();
$("#navcontent").animate({ 'right': '-' + navcontentwidth + 'px' }, 300, function () { $("#navcontent").hide(); });
$("#navlogo").fadeOut(300);
});

function BaseShare(title, desc, link, imgUrl) {}

首页

分类

专题

我的

$(document).ready(function () {
var arr = $(".headercontent");
for (var i = 0; i < arr.length; i++) {
(function (index) {
var url = "https://m.zixin.com.cn/header.aspx";
$.get(url + "?tp=0&t=" + (new Date()).valueOf(), function (d) {
try {
arr.eq(index).empty().html(d);
} catch (e) { }
try {
arr.html(d);
} catch (e) { }
});
})(i);
}
});

$("img.lazys").lazyload({
threshold: 200,
effect: "fadeIn"
});

public int getid(){return this.id;}
public int getweight(){return this.weihgt;}
public int getvalue(){return this.value;}
public float getvw(){return (float)this.value/this.weihgt;}
@Override
public int compareTo(object o) {
// TODO Auto-generated method stub
if(this.getvw()>o.getvw()) return -1;
if(this.getvw()

关于我们      便捷服务       自信AI       AI导航        抽奖活动©2010-2026 宁波自信网络信息技术有限公司  版权所有客服电话：[phone]  投诉电话：[phone]浙公网安备33021202000488号   浙ICP备2021020529号-1  |  浙B2-20240490  关注我们 ：