HDU 1051 Wooden Sticks (贪心)

Wooden Sticks

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 21337    Accepted Submission(s): 8606

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

  
  

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

 

Sample Output

  
  

   
   2
1
3
  
  

 

思路:

  最开始一定是一分钟, 如果后,面的x,y 都比前面的大 时间就不增加,  当 不满足时, 时间+1   记录 最小的时间 

一个for循环 扫描, 一个记录 是否访问.

/*
扫描
*/
#include <iostream>
#include <algorithm>
#include <stack>
#include <stdio.h>
#include <queue>
#include <string.h>
#include <cstring>
#include <cmath>
#include <string>

using namespace std;
struct node{
    int x,y;
}s[10010];
int vis[10010];
int cmp(node a,node b)
{
    if(a.x==b.x)
        return a.y<b.y;
    return a.x<b.x;
}
int main()
{
    int sum,T,n,i,j;
    cin>>T;
    while(T--)
    {
        memset(vis,0,sizeof(vis));
        scanf("%d",&n);
        for(i=0;i<n;i++)
        {
            scanf("%d %d",&s[i].x,&s[i].y);
        }
        sort(s,s+n,cmp);
        sum=0;
//        for(i=0;i<n;i++)
//        {
//            printf("%d %d\n",s[i].x,s[i].y);
//        }
        sum=0;
        int temp;
        for(i=0;i<n;i++)
        {
            if(!vis[i])
            {
                vis[i]=1;
                sum+=1;
                temp=i;
                for(j=i+1;j<n;j++)
                {
                    if(s[j].x>=s[temp].x&&s[j].y>=s[temp].y&&!vis[j])
                    {
                        vis[j]=1;
                        temp=j;
                    }
                }
            }

        }
        cout<<sum<<endl;

    }
    return 0;
}

/*
3
5
2 9 5 2 2 1 3 5 1 4
*/

123