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
题意:加工木棒,给了长度和质量,如果下一个质量和长度大于等于上一个,那机器就不用准备时间,否则需要一分钟,求最短时间
思路:其实就是先按长度排序,再按质量排序就好了
感想:题比较好想啊,但是代码实现比较麻烦,弄了好长好长时间,后面讨论的快把自己绕进去了
AC代码:
#include<iostream>
#include<string.h>
#include<set>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<numeric>
#include<math.h>
#include<string.h>
#include<sstream>
#include<stdio.h>
#include<string>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<map>
#include<queue>
#include<string>
using namespace std;
struct arr
{
int a;
int b;
};
bool cmp(const arr &s,const arr &w)
{
if(s.a<w.a) return true;
else if(s.a==w.a)return s.b<w.b;
return false;
}
int main()
{
int n;
cin>>n;
int i;
arr a[10000];
int b[10000];
int max;
int t;
for(i=1;i<=n;i++)
{
int c;
cin>>c;
int j;
for(j=1;j<=c;j++)
{
cin>>a[j].a;
cin>>a[j].b;
}
sort(a+1,a+c+1,cmp);
memset(b,0,sizeof(b));
int l;
int sum;
sum=0;
int p ,z,zz,pp;
for(j=1;j<=c;j++)
{
if(b[j]==1)
continue;
b[j]=1;
sum++;
p=a[j].b;
for(z=j+1;z<=c;z++)
{
if(p<=a[z].b&&b[z]==0)
{ p=a[z].b;
b[z]=1;
}
}
zz=0;
for(pp=1;pp<=c;pp++)
if(b[pp]==1)
zz++;
if(zz==c)
break;
}
cout<<sum<<endl;
}
return 0;
}