ACM-HDU1051-Wooden Sticks

Wooden Sticks

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

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
  
  
  
  

   
   
#include<algorithm>
#include<stdio.h>
#include<string.h>
using namespace std;
struct e
{
    int x;
    int y;
}a[10000];
int cmp(e a,e b)
{
if(a.x==b.x) return a.y<b.y;
 return a.x<b.x;
}
int main()
{
int n,i,q,j,s,tem;
scanf("%d",&n);
while(n--)
{int q;int sum=0;
scanf("%d",&q);
for(i=0;i<q;i++) scanf("%d%d",&a[i].x,&a[i].y);
   sort(a,a+q,cmp);
    //for(i=0;i<q+1;i++) printf("%d ",a[i].y);printf("\n");
for(i=0;i<q;i++){tem=a[i].y;
    for(j=i+1;j<q;j++)
        {if(tem==0);
    else if(tem<=a[j].y) {tem=a[j].y; a[j].y=0;  }  }
  //  for(i=0;i<q+1;i++) printf("%d ",a[i].y);printf("\n");

}for(i=0;i<q+1;i++) if(a[i].y!=0) sum++;
printf("%d\n",sum);}
return 0;}

   
   
一开始把问题搞复杂了，后来其实只需要对一个排序就可以，
  
  
  
  

   
   另一个用贪心策略，两个同时排序感觉不太好做。
  
  
  
  

   
   对一个值排序，另一个选择符合题意的，这里最好列出来，
  
  
  
  

   
   然后符合题意做好标记，标记为0，以后忽略标记为0的，最后找找几个不是0的。