连续邮资问题(共4页).docx

精选优质文档-倾情为你奉上连续邮资问题#include using namespace std;class Stampfriend int MaxStamp(int ,int ,int );private:void Backtrack(int i,int r);int n;/邮票面值数int m;/每张信封最多允许贴的邮票数int maxvalue;/以后最优值int maxint;/大整数int maxl;/邮资上界int *x;/以后解int *y;/贴出各种邮资所需起码邮票数int *bestx;/以后最优解;int MaxStamp(int n,int m,int bestx);int main()int *bestx;int n = 5;int m = 4;cout邮票面值数:nendl;cout每张信封最多允许贴的邮票数:m