回溯法解决转载问题

#include <iostream>
using namespace std;

const int MAX=10;
const int n=3;
//const int i=1;
int w[]={10,40,40};
int cw=0,bestw=0,r=90,c=50;
int bestx[MAX],x[MAX];
int Backtrack(int i)
{
        if(i>=n)
        {
                if(cw>bestw)
                {
                        for(int j=0;j<n;j++)
                                bestx[j]=x[j];
                        bestw=cw;
                }
                return 0;
        }
        r-=w[i];
        if(cw+w[i]<=c)
        {
                x[i]=1;
                cw+=w[i];
                Backtrack(i+1);
                cw-=w[i];
        }
        if(cw+r>bestw)
        {
                x[i]=0;
                Backtrack(i+1);
        }
        r+=w[i];
}
int main()
{
        Backtrack(0);
        cout<<bestw<<endl;
        for(int i=0;i<n;i++)
                cout<<bestx[i];
        cout<<endl;
        scanf("%*s");
        return 0;
}