#include<stdio.h>
#include<stdlib.h>
typedef int* pointer;
int min(int a,int b){
return a > b? b:a;
}
int max(int a,int b){
return a > b? a:b;
}
void LodingC1(int C1,int* w,int n,int* x,int** m)
//C1为第一艘船的载重,w数组是重量数组,n为集装箱数量,
//x数组用来标记第i个集装箱是否装入船1,m[i][j]表示第一艘
//船剩余容量j下,从第i个货物到第n个货物最大装载重量。
{
int jMax = min(w[n]-1,C1);
//处理最后一行
for(int j = 0;j <= jMax;j++)
m[n][j] = 0;
for( j = w[n];j <= C1;j++)
m[n][j] = w[n];
for(int i = n-1;i > 0;i--){
jMax = min(w[i]-1,C1);
for( j = 0;j <= jMax;j++)
m[i][j] = m[i+1][j];
for( j = w[i];j <= C1;j++)
m[i][j] = max( m[i+1][j] , m[i+1][ j-w[i] ] + w[i] );
}
for( i = 1;i < n;i++)
{
if(m[i][C1] == m[i+1][C1])
x[i] = 0;
else
{
x[i] = 1;C1-= w[i];
}
}
x[n] = (m[n][C1])? 1:0;
}
void Loding(int C2,int *x,int n,int *w){
int Weight = 0;
int weightC1 = 0;
for(int i = 1;i <= n;i++){
Weight += w[i];
if(x[i]==1)
weightC1 += w[i];
}
if((Weight - weightC1) > C2)
printf("该装载问题无解!\n");
else
{
printf("装在第一艘船上的集装箱为:");
for(int i = 1;i <= n;i++){
if(x[i]==1)
printf("%d,",i);
}
printf("\n装在第二艘船上的集装箱为:");
for( i = 1;i <= n;i++){
if(0==x[i])
printf("%d,",i);
}
}
}
void main(){
int C1,C2,n,t;
printf("输入两艘船各自的载重量:");
scanf("%d %d",&C1,&C2);
printf("\n输入集装箱数量:");
scanf("%d",&n);
/*pointer *p = new pointer[n+1];
for(int i = 0;i <= n;i++)
p[i] = new int[n+1];
int *x = new int[n+1];//是否装入第一艘船
int *w = new int[n+1];//集装箱的重量数组*/
int *x = (int*)malloc((n+1)*sizeof(int));
int *w = (int*)malloc((n+1)*sizeof(int));
int ** p = (int**)malloc((n+1)*sizeof(int*));
for (int i = 0; i <= n ; i++ ) {
p[i] = (int*)malloc( (C1+1) * sizeof(int) );
}
printf("依次输入每个集装箱的重量:\n");
for( i = 1;i <= n;i++){
scanf("%d",&t);
w[i] = t;
}
LodingC1(C1,w,n,x,p);
Loding(C2,x,n,w);
free(x);
free(w);
free(p);
}
#include<stdlib.h>
typedef int* pointer;
int min(int a,int b){
return a > b? b:a;
}
int max(int a,int b){
return a > b? a:b;
}
void LodingC1(int C1,int* w,int n,int* x,int** m)
//C1为第一艘船的载重,w数组是重量数组,n为集装箱数量,
//x数组用来标记第i个集装箱是否装入船1,m[i][j]表示第一艘
//船剩余容量j下,从第i个货物到第n个货物最大装载重量。
{
int jMax = min(w[n]-1,C1);
//处理最后一行
for(int j = 0;j <= jMax;j++)
m[n][j] = 0;
for( j = w[n];j <= C1;j++)
m[n][j] = w[n];
for(int i = n-1;i > 0;i--){
jMax = min(w[i]-1,C1);
for( j = 0;j <= jMax;j++)
m[i][j] = m[i+1][j];
for( j = w[i];j <= C1;j++)
m[i][j] = max( m[i+1][j] , m[i+1][ j-w[i] ] + w[i] );
}
for( i = 1;i < n;i++)
{
if(m[i][C1] == m[i+1][C1])
x[i] = 0;
else
{
x[i] = 1;C1-= w[i];
}
}
x[n] = (m[n][C1])? 1:0;
}
void Loding(int C2,int *x,int n,int *w){
int Weight = 0;
int weightC1 = 0;
for(int i = 1;i <= n;i++){
Weight += w[i];
if(x[i]==1)
weightC1 += w[i];
}
if((Weight - weightC1) > C2)
printf("该装载问题无解!\n");
else
{
printf("装在第一艘船上的集装箱为:");
for(int i = 1;i <= n;i++){
if(x[i]==1)
printf("%d,",i);
}
printf("\n装在第二艘船上的集装箱为:");
for( i = 1;i <= n;i++){
if(0==x[i])
printf("%d,",i);
}
}
}
void main(){
int C1,C2,n,t;
printf("输入两艘船各自的载重量:");
scanf("%d %d",&C1,&C2);
printf("\n输入集装箱数量:");
scanf("%d",&n);
/*pointer *p = new pointer[n+1];
for(int i = 0;i <= n;i++)
p[i] = new int[n+1];
int *x = new int[n+1];//是否装入第一艘船
int *w = new int[n+1];//集装箱的重量数组*/
int *x = (int*)malloc((n+1)*sizeof(int));
int *w = (int*)malloc((n+1)*sizeof(int));
int ** p = (int**)malloc((n+1)*sizeof(int*));
for (int i = 0; i <= n ; i++ ) {
p[i] = (int*)malloc( (C1+1) * sizeof(int) );
}
printf("依次输入每个集装箱的重量:\n");
for( i = 1;i <= n;i++){
scanf("%d",&t);
w[i] = t;
}
LodingC1(C1,w,n,x,p);
Loding(C2,x,n,w);
free(x);
free(w);
free(p);
}