HDU 1051 Wooden Sticks

原创 2016年08月28日 18:52:29
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<iostream>
#include<algorithm>
using namespace std;
struct wood
{
  int l,w;


}w[5005],wo[5005];
bool cmp(wood x,wood y)
{
  if(x.l==y.l)
        return x.w<y.w;
     else
         return x.l<y.l;
}
int main()
{
  int t,n,x,y,i,j,k,f,a;
  cin>>t;
  while(t--)
  {
    cin>>n;
    for(i=0;i<n;i++)
        cin>>wo[i].l>>wo[i].w;
    sort(wo,wo+n,cmp);


    k=0;
    for(a=0;a<n;a++)
    {
      f=0;
      for(i=0;i<k;i++)
      {
        if(wo[a].l>=w[i].l &&wo[a].w>=w[i].w)
        {
             f=1;
             w[i].l=wo[a].l;
             w[i].w=wo[a].w;
             break;
        }


      }
        if(!f)
            {
              j=k;
              w[j].l=wo[a].l;
              w[j].w=wo[a].w;
              k++;
            }


    }
    cout<<k<<endl;


  }


}



HDU-1051-Wooden Sticks(C++ && 不水的贪心!)

Wooden Sticks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...
  • qq_16542775
  • qq_16542775
  • 2015年06月20日 11:38
  • 1223

杭电OJ——1051 Wooden Sticks

Wooden Sticks Problem Description There is a pile of n wooden sticks. The length and weight of ...
  • lishuhuakai
  • lishuhuakai
  • 2012年10月26日 22:52
  • 5957

[ACM] hdu 1051 Wooden Sticks

Wooden Sticks Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Tota...
  • sr19930829
  • sr19930829
  • 2014年03月10日 20:56
  • 1869

POJ1065 Wooden Sticks(贪心+动态规划——单调递增子序列)

POJ1065 Wooden Sticks(贪心+动态规划——单调递增子序列)
  • niushuai666
  • niushuai666
  • 2011年05月14日 16:27
  • 5131

HDU 1051 Wooden Sticks

Wooden Sticks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...
  • LiuJiuXiaoShiTou
  • LiuJiuXiaoShiTou
  • 2017年07月29日 21:50
  • 242

HDU 1051:Wooden Sticks

Wooden Sticks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) To...
  • qq_28954601
  • qq_28954601
  • 2016年02月04日 09:54
  • 492

Wooden Sticks HDU 1051

大学!  Wooden Sticks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java...
  • qq_38376279
  • qq_38376279
  • 2017年06月01日 21:32
  • 59

hdu 1051 wooden sticks

Wooden Sticks Problem Description There is a pile of n wooden sticks. The length and weight of ...
  • cvb00052
  • cvb00052
  • 2015年11月21日 20:05
  • 113

HDU 1051:Wooden Sticks

Wooden Sticks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...
  • u013487051
  • u013487051
  • 2014年07月31日 21:04
  • 642

HDU 1051 Wooden Sticks

Wooden Sticks Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) To...
  • Ever_glow
  • Ever_glow
  • 2017年05月27日 17:03
  • 378
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 1051 Wooden Sticks
举报原因:
原因补充:

(最多只允许输入30个字)