hdu 1051 wooden sticks

原创 2015年11月21日 20:05:19

Wooden Sticks




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




没什么特别想法
主要是先排序,按长度来排序。然后重量跟着长度变换就好,其实长度相等的时候重量怎么排序问题都不大,因为是根据这个数据是否处理过来进行处理数据的,用flag[]=1来标记这个数据未被处理,=0的时候就是处理过了,下次进行的时候就不对这个数据进行考虑。
长度排完序后,看看有多少组重量排序就有多少分钟。从最高位开始找起,因为排序是升序排序。
还要考虑当最后一个是独立一组的时候,分钟数直接加一就行,因为进入循环的话就是变成[0]与[-1]的比较,而[-1]并没有定义。
看了其他人的代码才有的想法,运用到贪心算法,虽然我还是不怎么理解这个算法,代码也比较繁杂,但是最近做了一点这类题还是有点收获的。

代码如下


#include <iostream>
using namespace std;

void bsort (int a[], int n, int b[]);

int main()
{
	int n;
	cin >> n;
	while(n--) {
		int n1;
		cin >> n1;
		int count = 0;
		int a[5001] = {0}, b[5001] = {0};
		int i = 0;
		int flag[5001]; 
		while(n1--) {
			cin >> a[i] >> b[i];
			flag[i] = 1;
			i++;
		}
		bsort(a, i, b);
		for(int k = i - 1; k >= 0; k--) {
			int w = k;
			if(flag[w]){
				if(w == 0) count++;
				else
					for(int q = w - 1; q >= 0; q--) {
						if(b[w] >= b[q] && flag[q] == 1) {
							flag[w] = 0;
							flag[q] = 0;
							w = q;
						}
						if(q == 0) count++;
					}
			}
		}
		cout << count << endl;
	}
}

void bsort (int a[], int n, int b[])
{
	int i, k;
	for(i = 0; i < n - 1; i++)
		for(k = 0; k < n - 1 - i; k++) {
			if(a[k] > a[k+1]) {
				int t = a[k];
				a[k] = a[k+1];
				a[k+1] = t;
				int q = b[k];
				b[k] = b[k+1];
				b[k+1] = q;
			}
		}
}


2 1 3

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
  • 5964

[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
  • 1873

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

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

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
  • 383

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
  • 60

HDU 1051 Wooden Sticks

此题大意是说给你N根木头的长度和重量,制作第一根木头时需要一分钟,以后每根木头的长度和重量只要都比前一根大就不需要建立时间,否则需要加一分钟,让你求最少时间。这是一道贪心题目,首先,将所有的木头按照长...
  • Dinivity123
  • Dinivity123
  • 2013年01月23日 08:34
  • 626
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:hdu 1051 wooden sticks
举报原因:
原因补充:

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