HDU 1051

原创 2013年12月05日 21:00:08

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


题意:给出N个木棍,每个木棍有其长度和重量。哎呀。麻烦,不会说,自己问有道吧。。。

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
struct node
{
	int l,w;
}a[5010];
bool cmp(node a,node b)
{
	if (a.l!=b.l) return a.l<b.l;
	else return a.w<b.w;
}
int vis[5010];
int main()
{
	int T,n,i,j;
	scanf("%d",&T);
	while (T--)
	{
		scanf("%d",&n);
		for (i=0;i<n;i++)
			scanf("%d%d",&a[i].l,&a[i].w);
		sort(a,a+n,cmp);
		int t=0;
		memset(vis,0,sizeof(vis));
		for (i=0;i<n;i++)
		if (vis[i]==0)
		{
			int k=i;
			//printf("%d %d\n",a[i].l,a[i].w);
			vis[i]=1;
			for (j=i+1;j<n;j++)
				if (vis[j]==0 && a[j].l>=a[k].l && a[j].w>=a[k].w)
				{
					vis[j]=1;
					k=j;
				}
			t++;
		}
		printf("%d\n",t);
	} 
	return 0;
}





hdu1051-Air Raid(DAG的最小路径覆盖,匹配问题)

题目来源:http://acm.hdu.edu.cn/hp?pid=1151题意在一个DAG(有向无环)图上,编写程序求最小数量的伞兵,这些伞兵可以访问所有的点。思路DAG图最小路径覆盖问题: 用尽...

HDU 1051 Wooden Sticks(贪心)

题目传送门:点击打开链接 Wooden Sticks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (J...

Wooden Sticks (HDU 1051)

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

HDU 1051(贪心)

超时代码“#include #include #include #include #include #include #include #include using namespace std;con...

HDU1051 Wooden Sticks(贪心)

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

HDU1051: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 贪心

给定一些木棒的长和重,安装第一根木棒时间为1分钟,然后如果安装的上一支木棒的长和重均不超过下一支木棒的长和重,那么不需要安装时间,否则要1分钟。 求最短的安装时间。...

HDU 1051.Wooden Sticks【贪心】【8月26】

Wooden Sticks Problem Description There is a pile of n wooden sticks. The length and weight of ea...

ZOJ-1025(POJ-1065、HDU-1051) Wooden Sticks

Wooden Sticks Time Limit: 2 Seconds      Memory Limit: 65536 KB There is a pile of n wooden st...

HDU 1051 Wooden Sticks

Wooden Sticks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 1051
举报原因:
原因补充:

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