HDOJ 1069_大二写-白红宇

HDOJ 1069_大二写

阅读量：4593 次

发布时间：2019-06-09

本文共 1318 字，大约阅读时间需要 4 分钟。

AC代码：

//HDOJ 1069#include 
     
      #include 
      
       #include 
       
        #define Max 100using namespace std;struct dimensinos{    int l;    int w;    int d;    long int max_deadline_unit;}block[Max];bool compare(dimensinos a, dimensinos b){    return a.l*a.w > b.l*b.w ;}int main(void){    freopen("in.txt","r",stdin);    int N, count = 1;    while(scanf("%d",&N) && N)    {        int  x, y, z;        long int max_universe;        for(int i = 1; i <= N * 3; i++)        {            scanf("%d%d%d", &x, &y, &z);                block[i].l = x;                block[i].w = y;                block[i].d = z;                                block[++i].l = z;                    block[i].w = x;                    block[i].d = y;                                block[++i].l = y;                    block[i].w = z;                    block[i].d = x;                    }        sort(block + 1, block + 1 + N * 3, compare);     //面积从大到小排序                 //算法的核心部分         block[1].max_deadline_unit = block[1].d;        max_universe = block[1].max_deadline_unit;        for(int i = 2; i <= 3*N; i++)        {            block[i].max_deadline_unit = block[i].d;            for(int j = i-1; j >= 1; j--)            {                if(!((block[i].l