1poj1065(贪心)

http://poj.org/problem?id=1065

Wooden Sticks

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 14947		Accepted: 6132

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

Source

Taejon 2001

有n个木棒，分别不同的长度和不同的重量，一个机器需要处理这些木棒，如果第i+1个木棒的重量和长度都>=第i个处理的木棒，那么将不会耗费时间，否则需要增加一个单位的时间，问最少需要多少时间处理完（包括机器启动的时间）。

  思路：按木棍的长度从小到大排序,当木棍长度相等时按重量小到大排序.然后依次选择比当前重量大的木棍加入到一个集合,这个集合木棒的顺序是按重量和长度递增的,所以这个集合只需要一个单位的时间就可以处理完,很明显这是最优的(已经对木棍进行排序,每次选择都是对后面影响最小的),选择的同时对选过的木棍进行标记,这样进行一轮后,将处理时间加1,再对剩下的木棍进行同样的选择,即可得到最优解。

struct node{
6 int l,w;
7 }n[Max];
9 int an[Max];
10 bool cmp(node x,node y)//排序
11 {
12 if(x.w==y.w) return x.l<y.l;
13 return x.w<y.w;
14 }

 

 

#include<iostream>
#include<algorithm>
using namespace std;
typedef struct s
{
 int l;
 int w;
}s;
s p[5010];
int cmp(const void *a,const void*b)
{
 if((*(s*)a).l ==(*(s*)b).l )//长度相等按重量递增排序
  return ((*(s*)a).w -(*(s*)b).w );
 else//否则按长度递增排序
  return ((*(s*)a).l -(*(s*)b).l );
}
int main()
{
 int n,m;
 int i,j,sum,t;
 scanf("%d",&n);
 while(n--)
 {
  sum=0;
  scanf("%d",&m);
  for(i=0;i<m;i++)
  {
   scanf("%d%d",&p[i].l ,&p[i].w );
  }
  qsort(p,m,sizeof(p[0]),cmp);//排序
  for(i=0;i<m;i++)//因为长度已经是按从小大到排序的只要分析weight就行了(有点像控制变量法)
  {
   if(p[i].w !=0)
   {
    sum++;
    t=p[i].w;
    for(j=i+1;j<m;j++)
    {
     if(p[j].w >=t)
     {
      t=p[j].w;
      p[j].w =0;//表示已经用过
     }
    }
   }
  }
  printf("%d\n",sum);
 }
 return 0;
}