poj1065

Wooden Sticks

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 23751		Accepted: 10236

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 ( 9 , 4 ) , ( 2 , 5 ) , ( 1 , 2 ) , ( 5 , 3 ) , and ( 4 , 1 ) , then the minimum setup time should be 2 minutes since there is a sequence of pairs ( 4 , 1 ) , ( 5 , 3 ) , ( 9 , 4 ) , ( 1 , 2 ) , ( 2 , 5 ) .

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 2n 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

题意：C小加有一些木棒，它们的长度和质量都已经知道，需要一个机器处理这些木棒，机器开启的时候需要耗费一个单位的时间，如果第i+1个木棒的重量和长度都大于等于第i个处理的木棒，那么将不会耗费时间，否则需要消耗一个单位的时间。因为急着去约会，C小加想在最短的时间内把木棒处理完，你能告诉他应该怎样做吗？

思路：这题可以先按照长度排个序，短的排在前面，然后从头往后扫，找出宽度递增的，找过的就标记一下。

代码：
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
struct node
{
    int a,b;
}a[5005];
bool cmp(node a,node b)
{
    if(a.a!=b.a)return a.a<b.a;
    else return a.b<b.b;
}
int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        int flag[5005];
        memset(flag,0,sizeof(flag));
        int i,j;
        int m;
        scanf("%d",&m);
        for(i=0;i<m;i++)
        {
            scanf("%d %d",&a[i].a,&a[i].b);
        }
        sort(a,a+m,cmp);
        int sum=0;
        for(i=0;i<m;i++)
        {

            if(flag[i]==0)
            {
                flag[i]=1;
                int z=a[i].b;
                for(j=i+1;j<m;j++)
              {
                if(flag[j]==0&&a[j].b>=z)
                {
                    z=a[j].b;
                    flag[j]=1;
                }
               }
                sum++;
            }


        }
        cout<<sum<<endl;
    }
    return 0;
}