HDU ACM 1051 Wooden Sticks


Problem Description

There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to prepare processing a stick. The setup times are associated with cleaning operations and changing tools and shapes in the machine. The setup times of the woodworking machine are given as follows:

(a) The setup time for the first wooden stick is 1 minute.
(b) Right after processing a stick of length l and weight w , the machine will need no setup time for a stick of length l’ and weight w’ if l<=l’ and w<=w’. Otherwise, it will need 1 minute for setup.

You are to find the minimum setup time to process a given pile of n wooden sticks. For example, if you have five sticks whose pairs of length and weight are (4,9), (5,2), (2,1), (3,5), and (1,4), then the minimum setup time should be 2 minutes since there is a sequence of pairs (1,4), (3,5), (4,9), (2,1), (5,2).


The input consists of T test cases. The number of test cases (T) is given in the first line of the input file. Each test case consists of two lines: The first line has an integer n , 1<=n<=5000, that represents the number of wooden sticks in the test case, and the second line contains n 2 positive integers l1, w1, l2, w2, …, ln, wn, each of magnitude at most 10000 , where li and wi are the length and weight of the i th wooden stick, respectively. The 2n integers are delimited by one or more spaces.


The output should contain the minimum setup time in minutes, one per line.

Sample Input

4 9 5 2 2 1 3 5 1 4
2 2 1 1 2 2
1 3 2 2 3 1

Sample Output





#include <iostream>
#include <algorithm>
using namespace std;

struct wood
    int l, w, flag;             // 增加flag标旗,0表示未处理,1表示已处理

bool cmp(wood a,wood b)         // 长度长的放前面,如果长度一样,重量重的放前面
    return a.l != b.l ? a.l > b.l : a.w > b.w;

int main()
    int t, n, ans, min;
    cin >> t;
        ans = 0;
        cin >> n;
        for (int i = 0; i < n;i++)
            cin >> W[i].l >> W[i].w;
            W[i].flag = 0;
        sort(W, W + n, cmp);                // 长度长的排前面,反向枚举

        for (int i = 0; i < n;i++)
            if (W[i].flag == 1)
            W[i].flag = 1;                  // 开始第一趟枚举
            min = W[i].w;                   // 标记当前的木头重量
            for (int j = i + 1; j < n; j++)
                if (W[j].w <= min && W[j].flag == 0)    // 与之后的比较重量,如果重量小于前一个,那标记为已处理,并且赋值给min
                    min = W[j].w;
                    W[j].flag = 1;
        cout << ans << endl;
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/jjhfen00/article/details/49936429
文章标签: acm 贪心
上一篇HDU ACM 1789 Doing Homework again
下一篇HDU ACM 1052 Tian Ji -- The Horse Racing
想对作者说点什么? 我来说一句


2001年09月16日 67B 下载

hdu acm 教案(4)

2008年10月02日 839KB 下载

hdu acm 教案(11)

2008年10月02日 135KB 下载

hdu acm 教案(6)

2008年10月02日 309KB 下载

hdu acm 教案(7)

2008年10月02日 162KB 下载

hdu acm 教案(8)

2008年10月02日 1.11MB 下载

hdu acm 教案(5)

2008年10月02日 246KB 下载

hdu acm 教案(3)

2008年10月02日 309KB 下载

hdu acm 教案(9)

2008年10月02日 151KB 下载