回溯算法解决装载问题

回溯算法解决装在问题

C语言

#include<stdio.h>
#include<stdlib.h>

#define OK 1
#define NO 0
#define N_SIZE 5

int x[N_SIZE+1]={0};
int bestx[N_SIZE+1]={0};
int w[N_SIZE+1]={0,1,4,7,5,2};
int c1,c2;
int B,best;
int i=1;
int Partition(int a[],int left,int right)
{
    int prvo=a[left];
    while(left<right)
    {
        while(left<right&&a[right]<=prvo)
        {
            right--;
        }
        a[left]=a[right];
        while(left<right&&a[left]>=prvo)
        {
            left++;
        }
        a[right]=a[left];
    }
    a[right]=prvo;
    return right;
}
void QuickSort(int a[],int left,int right)
{
    if(left<right)
    {
        int p=Partition(a,left,right);
        QuickSort(a,left,p-1);
        QuickSort(a,p+1,right);
    }
}

void backtrack(int i)
{
    while(i>1&&x[i]==0)
    {
        i-=1;
    }
    if(x[i]==1)
    {
        x[i]=0;
        B=B+w[i];
        i=i+1;
    }
}

int Loading()
{
    
    while(i<=N_SIZE)
    {
        if(B>=w[i])
        {
            B-=w[i];
            x[i]=1;
            i++;
        }
        else
        {
            x[i]=0;
            i++;
        }
    }
    if(B<best)
    {
        best=B;
        for(int j=1;j<=N_SIZE;j++)
        {
            bestx[j]=x[j];
        }
    }
    if(B==0)
    {
        return OK;
    }
    if(i==1)
    {
        int s=0;
        for(int j=1;j<=N_SIZE;j++)
        {
            s+=(w[j]*(1-bestx[j]));
        }
        if(s<=c2)
        {
            return OK;
        }
    }
    backtrack(i);
}
int main(void)
{

    c1=9,c2=11;
    B=c1,best=c1;
    QuickSort(w,1,N_SIZE);
    for(int j=1;j<=N_SIZE;j++)
    {
        printf("%d\t",w[j]);
    }
    printf("\n");
    if(Loading())
    {
        printf("yes\n");
        for(int j=1;j<=N_SIZE;j++)
        {
            printf("%d\t",bestx[j]);
        }
            printf("\n");
    }
    else
    {
        printf("NO!\n");
    }
    return 0;
}