hdu1051Wooden Sticks

最新推荐文章于 2019-11-18 13:32:49 发布

一只大秀逗

最新推荐文章于 2019-11-18 13:32:49 发布

阅读量151

点赞数

分类专栏： HDU 贪心

本文链接：https://blog.csdn.net/sunny_hun/article/details/81805441

版权

HDU 同时被 2 个专栏收录

42 篇文章 0 订阅

订阅专栏

贪心

1 篇文章 0 订阅

订阅专栏

Wooden Sticks

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 25490 Accepted Submission(s): 10314
http://acm.hdu.edu.cn/showproblem.php?pid=1051

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).

Input

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.

Output

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

题意：棍子有（长度，重量）。一个序列中，如果长度、重量都>上一个，为一组。问有几组？

如：（4,9），（5,2），（2,1），（3,5），（1,4）有两组

（1,4），（3,5），（4,9）和（2,1），（5,2）。

思路：贪心。

代码：

#include<iostream>
#include<cstring>
#include<cmath>
#include<iomanip>
#include<algorithm>
#include<cstdio>
#define inf 0x3f3f3f3f
using namespace std;
//贪心算法---先排序---后选择第一个没有用过的木头依次向后找，
//用掉所有可以用掉的木头，然后返回第一个没用过的木头继续找
struct node
{
    int x;
    int y;
    int id;
}s[5005];

int cmp(node a,node b)
{
    if(a.x==b.x)
        return a.y<b.y;
    return a.x<b.x;
}


int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        for(int i=0;i<n;i++)
            cin>>s[i].x>>s[i].y;
        sort(s,s+n,cmp);
        for(int i=0;i<n;i++)
        {
            s[i].id=1;
        }
        int sum=0;
        for(int i=0;i<n;i++)
        {
            if(s[i].id)
            {
                int minn=s[i].y;
                for(int j=i+1;j<n;j++)
                {
                    if(s[j].y>=minn&&s[j].id==1)
                    {
                        minn=s[j].y;
                        s[j].id=0;
                    }
                }
                sum++;
            }
        }
        cout<<sum<<endl;
    }
    return 0;
}