ZOJ1025Wooden Sticks 贪心算法

 

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1025

 

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

Output for the Sample Input

2 
1 
3

 

---

以下是我的代码：

---

#include<iostream> using namespace std; const int MAXSIZE = 5000; /****************************************************** -----函数名称：void Bubble_sort -----函数功能：冒泡排序 -----入口参数： -----入口参数：none -----函数设计：zhaojiandong ******************************************************/ void Bubble_sort(int *l,int *w,int m) { int tmp=0; for(int ii=0;ii<m-1;ii++) { bool issort=false; //最先设置没有排序 for (int jj = 0; jj < m-1-ii; jj++) { if(l[jj]>l[jj+1]) { //tmp=sum[jj]; //sum[jj] = sum[jj+1]; //sum[jj+1]=tmp; tmp = l[jj]; l[jj] = l[jj+1]; l[jj+1] = tmp; tmp = w[jj]; w[jj] = w[jj+1]; w[jj+1] = tmp; issort=true; //进行过排序就设置true } } if(!issort) //如果每次没有进行排序，就是排序完成了 break; } } /****************************************************** -----函数名称：void Solve -----函数功能：贪心算法 -----入口参数： -----入口参数：none -----函数设计：time ******************************************************/ int Solve(int *l,int *w,int n) { int isselect[MAXSIZE]={0}; //表示有没有便选择过 int time=0; for(int ii=0;ii<n;ii++) { if(!isselect[ii]) //表示没有被标记过 { time++; isselect[ii]=true; int tmpl=l[ii],tmpw=w[ii]; //临时长度,重量 for(int jj=0;jj<n;jj++) //把选择过的标记了 { if(!isselect[jj]) { if(tmpl<=l[jj]&&tmpw<=w[jj]) { tmpl=l[jj]; tmpw=w[jj]; isselect[jj]=true; } } } } } return time; } int main() { int cases; //定义测试组数 int n=0; //定义每组测试的数目 int l[MAXSIZE],w[MAXSIZE]; cin>>cases; for(int ii=0;ii<cases;ii++) { int time=0; cin>>n; //读入每行的数量 for(int jj=0;jj<n;jj++) cin>>l[jj]>>w[jj]; Bubble_sort(l,w,n); //sorting 排序 time = Solve(l,w,n); //解决算法 cout<<time<<endl; } }