knapsack.h

谈心算法实现0/1背包问题的解决

// Knapsack.h: interface for the Knapsack class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_KNAPSACK_H__329C4290_86E9_4012_B73E_C0AE554376F7__INCLUDED_)
#define AFX_KNAPSACK_H__329C4290_86E9_4012_B73E_C0AE554376F7__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000

//##ModelId=46189AD600CD
typedef struct item
{
	int value;
	int weight;
	int p;
}item;

//##ModelId=46189AD600DA
class Knapsack  
{
public:
	//##ModelId=46189AD600DB
	Knapsack();
	//##ModelId=46189AD600DC
	void Init_Knapsacl();
	//##ModelId=46189AD600DD
	void Most_Valuable();
	//##ModelId=46189AD600DE
	void Sort_Knapsacl();
	//##ModelId=46189AD600DF
	virtual ~Knapsack();
protected:
	//##ModelId=46189AD600EA
	int contain;
	//##ModelId=46189AD600EB
	int num;
	//##ModelId=46189AD600EC
	int *sorted;
	//##ModelId=46189AD600EE
	item *a;
};

#endif // !defined(AFX_KNAPSACK_H__329C4290_86E9_4012_B73E_C0AE554376F7__INCLUDED_)