Hdoj 1051 Wooden Sticks (LIS)

Source: Internet
Author: User
 Wooden Sticks

Time limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)
Total submission (s): 15700 Accepted Submission (s): 6451

Problem Description There is a pile of n wooden sticks. The length and weight of each stick is known in advance. The sticks is 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 is associated with cleaning operations and changing tools and shapes. The setup times of the woodworking machine is 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 would need no setup time for a stick of length l ' and weight W ' if l<=l ' and W<=w '. Otherwise, it'll need 1 minute for setup.

You is 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 is (4,9), (5,2), (2,1), (3,5), and (1,4), then the Minimum setup time should be 2 minutes since there are 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 on the first line of the input file. Each test case consists of a lines:the first line has a integer n, 1<=n<=5000, that represents the number of Wo Oden sticks in the test case, and the second line contains n 2 positive integers L1, W1, L2, W2, ..., LN, WN, each of Magn Itude at most 10000, where Li and wi is the length and weight of the i th wooden stick, respectively. The 2n integers is 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
This question and Nyoj 236 is the same, the specific problem and the question opinion: http://blog.csdn.net/zwj1452267376/article/details/49981029

The code is as follows:
#include <cstdio>
#include <algorithm>
using namespace std;
#define INF 0x3f3f3f
int dp[5010];
struct node
	int l,w;
} A[5010];

int CMP (node A,node b)
	if (A.W!=B.W)
		return a.w<b.w;
		return a.l<b.l;

int max (int a,int b)
	return a>b?a:b;

int main ()
	int n,i,j,ans,t;
	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);
		for (i=n-1;i>=0;--i)//note is the longest descending sub-sequence, that is, the longest ascending subsequence 
			*lower_bound (DP,DP+N,A[I].L) =a[i].l of the inverse;
		printf ("%d\n", Lower_bound (Dp,dp+n,inf)-DP);
	return 0;

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.