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;


  }


}



版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

HDU1051Wooden Sticks

Wooden Sticks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) To...

HDU 1051 Wooden Sticks

Problem Description There is a pile of n wooden sticks. The length and weight of each stick are kno...

HDU:1051 Wooden Sticks(贪心+动态规划DP||LIS?)

Wooden Sticks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...

HDU1051 Wooden Sticks(贪心)

题目: Wooden Sticks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/...

hdu 1051 (贪心)Wooden Sticks

Wooden Sticks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...

hdu 1051 Wooden Sticks

http://acm.hdu.edu.cn/showproblem.php?pid=1051 这个题直接用贪心做。 题意就是一个机器重置一次要一分钟,只要长度和重量都比前一次小则不用重...

HDU 1051 Wooden Sticks 木棍 贪心

Wooden Sticks Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) ...

hdu 1051 Wooden Sticks

对木棍的长度和重量进行排序,以长度为首要考虑。排序完后的不一定都是下一根木棍重量和长度都大于前一根的。于是,我们对排序后的数组进行多次扫描,将可以在一次建立时间内完成的进行标记,设置一个外部变量num...
  • jjike
  • jjike
  • 2013-02-06 10:33
  • 323

HDU 1051 Wooden Sticks 贪心

题意:找最长不下降子序列的个数。思路:我是这样做的,在前面所有没有访问过的序列中找一个比当前数值要小且自身数值最大的数,并把它标记为访问过,最后数没有访问过的数的个数,即是答案。因为当前数值肯定是由前...

hdu 1051 Wooden Sticks(贪心)

题目链接:点击打开链接 Wooden Sticks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (J...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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