Babs’ Box Boutique(DFS)

最新推荐文章于 2019-07-07 14:06:18 发布

原创最新推荐文章于 2019-07-07 14:06:18 发布 · 630 阅读

0 ·

CC 4.0 BY-SA版权

2013寒假集训专栏收录该内容

3 篇文章

订阅专栏

本文探讨了如何通过深度优先搜索算法解决长方体堆叠问题，即在遵循尺寸限制条件下，找出能够堆叠的最大数量的长方体。文章提供了一个具体的实现案例，并通过示例输入输出展示了算法的有效性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目链接：http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=1943

题目大意：从小到大排列长方体，使上面的边界小于等于下面的；

题目思路：DFS全部寻找一遍

题目：

Babs’ Box Boutique

Time Limit: 1000MS Memory limit: 65536K

题目描述

Babs sells boxes and lots of them. All her boxes are rectangular but come in many different sizes. Babs wants to create a really eye-catching display by stacking, one on top of another, as many boxes as she can outside her store. To maintain neatness and stability, she will always have the sides of the boxes parallel but will never put a box on top of another if the top box sticks out over the bottom one. For example, a box with base 5-by-10 can not be placed on a box with base 12-by-4.

Of course the boxes have three dimensions and Babs can orient the boxes anyway she wishes. Thus a

5-by-10-by-12 box may be stacked so the base is 5-by-10, 5-by-12, or 10-by-12.

For example, if Babs currently has 4 boxes of dimensions 2-2-9, 6-5-5, 1-4-9, and 3-1-1, she could stack up to 3 boxes but not all four. (For example, the third box, the first box, then the last box, appropriately oriented. Alternatively, the second box could replace the third (bottom) box.)

Babs’ stock rotates, so the boxes she stacks outside change frequently. It’s just too much for Babs to figure out and so she has come to you for help. Your job is to find the most boxes Babs can stack up

given her current inventory. Babs will have no more than 10 different sized boxes and will use at most one box of any size in her display.

输入

A positive integer n (n ≤ 10) will be on the first input line for each test case. Each of the next n lines will contain three positive integers giving the dimensions of a box. No two boxes will have identical dimensions. None of the dimensions will exceed 20. A line with 0 will follow the last test case.

输出

For each test case, output the maximum number of boxes Babs can stack using the format given below.

示例输入

示例输出

Case 1: 3
Case 2: 3

代码：

#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
struct node
{
    int x,y,z;
} w[15];
int n;
int visit[15];
int DFS(int a,int b,int num)
{
    int x1=num,x2=num,x3=num;
    for(int i=0; i<n; i++)
    {
        if(visit[i]==0)
        {
            if((w[i].x<=a&&w[i].y<=b)||(w[i].x<=b&&w[i].y<=a))
            {
                visit[i]=1;
                x1=max(x1,DFS(w[i].x,w[i].y,num+1));
            }
            visit[i]=0;
            if((w[i].x<=a&&w[i].z<=b)||(w[i].x<=b&&w[i].z<=a))
            {
                visit[i]=1;
                x2=max(x2,DFS(w[i].x,w[i].z,num+1));
            }
            visit[i]=0;
            if((w[i].y<=a&&w[i].z<=b)||(w[i].y<=b&&w[i].z<=a))
             {
                 visit[i]=1;
                 x3=max(x3,DFS(w[i].y,w[i].z,num+1));
             }
             visit[i]=0;
        }
    }
    int t=max(x1,x2);
    t=max(t,x3);
    num=t;
    //printf("%d %d %d %d\n",x1,x2,x3,num);
    return num;
}
int main()
{
    int fig=0;
    while(scanf("%d",&n))
    {
        if(n==0)
            break;
            fig++;
        memset(visit,0,sizeof(visit));
        for(int i=0; i<n; i++)
        {
            int aa,bb,cc;
            scanf("%d%d%d",&aa,&bb,&cc);
            w[i].x=aa;
            w[i].y=bb;
            w[i].z=cc;
        }
        printf("Case %d: %d\n",fig,DFS(25,25,0));
    }
    return 0;
}