hdoj Wooden Sticks 1051 (DP&LIS)

原创 2015年11月19日 12:44:13

Wooden Sticks

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 15658    Accepted Submission(s): 6434


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
 
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define N 5010
using namespace std;
struct zz
{
	int l;
	int r;
}q[N];
int b[N];
int cmp(zz a,zz b)
{
	return a.l<b.l||(a.l==b.l&&a.r<b.r);
}
int main()
{
	int n,t,i,j,mm;
	scanf("%d",&t);
	while(t--)
	{
		memset(b,0,sizeof(b));
		scanf("%d",&n);
		for(i=0;i<n;i++)
			scanf("%d%d",&q[i].l,&q[i].r);
		sort(q,q+n,cmp);
		mm=0;
		for(i=n-1;i>=0;i--)
		{
			b[i]=1;
			for(j=i+1;j<n;j++)
			{
				if(q[i].r>q[j].r&&b[j]+1>b[i])
					b[i]=b[j]+1;
				if(b[i]>mm)
					mm=b[i];
			}
		}
		printf("%d\n",mm);
	}
	return 0;
}

 

 

hdoj 1051 Wooden Sticks(LIS变形)

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

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

Wooden Sticks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...
  • zugofn
  • zugofn
  • 2016年08月11日 16:15
  • 183

HDU Problem 1051 Wooden Sticks 【LIS】

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

HDOJ 1051 Wooden Sticks(贪心)

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

ACM--木头序列--贪心+递减子序列--HDOJ 1051--Wooden Sticks

HDOJ题目地址:传送门 Wooden Sticks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/327...

【hdoj1051】Wooden Sticks(多关键字排序)

Wooden Sticks 大致题意:          工厂加工一批木棍,加工所用的设备调整一次需要一分钟,只要后面的木棍的长度和重量大于等于前面的木棍,设备就不用调整。设备第一次启动的时候也需...

zoj 1025 || poj 1065 || hdoj1051 Wooden Sticks

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

hdoj1051 Wooden Sticks(贪心算法+1,排序)

思路:典型的贪心算法思想,先求局部最优解,把问题划分为一个个子问题。 我先从第一根木棍开始,从头到尾遍历,求出一个满足题意的序列,并且用flag[i]数组记录第i根木棍是否已经被加入序列。 加入序列的...
  • CqZtw
  • CqZtw
  • 2017年06月02日 16:26
  • 127

(Java实现) HDOJ 1051 Wooden Sticks 贪心算法

Problem Description (a)第一根木材的安装时间是1分钟 (b)在处理完长度为l,宽度为w的木材后,若紧接着处理的木材长度l'>l且w'>w,则不需要安装时间,否则需1分钟安装时间 ...

hdu1051 Wooden Sticks(DP入门)

传说中的动态规划第一题。。。光看英语题就看了好久。。。 本题刚开始一看,这尼玛真简单,排个序筛选就行了,然而还是我图样。。。 拿第一个样例来说,排好序(1, 4),(2,1),(3,5),(4,9),...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:hdoj Wooden Sticks 1051 (DP&LIS)
举报原因:
原因补充:

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