POJ 1065:Wooden Sticks
来源:互联网 发布:工作流管理系统源码 编辑:程序博客网 时间:2024/05/18 00:15
Wooden Sticks
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20391 Accepted: 8611
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 ( 9 , 4 ) , ( 2 , 5 ) , ( 1 , 2 ) , ( 5 , 3 ) , and ( 4 , 1 ) , then the minimum setup time should be 2 minutes since there is a sequence of pairs ( 4 , 1 ) , ( 5 , 3 ) , ( 9 , 4 ) , ( 1 , 2 ) , ( 2 , 5 ) .
(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 ( 9 , 4 ) , ( 2 , 5 ) , ( 1 , 2 ) , ( 5 , 3 ) , and ( 4 , 1 ) , then the minimum setup time should be 2 minutes since there is a sequence of pairs ( 4 , 1 ) , ( 5 , 3 ) , ( 9 , 4 ) , ( 1 , 2 ) , ( 2 , 5 ) .
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 2n 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
213
Source
Taejon 2001
迷失在幽谷中的鸟儿,独自飞翔在这偌大的天地间,却不知自己该飞往何方……
#include<iostream> #include<string.h> #include<algorithm> using namespace std; struct mood { int w; int l; } d[5005]; bool cmp(mood a,mood b) { if(a.l==b.l) return a.w<b.w; return a.l<b.l; } int k[5005]; int main() { int n; cin>>n; while(n--) { int m; cin>>m; for(int i=0; i<m; i++) cin>>d[i].l>>d[i].w; sort(d,d+m,cmp); memset(k,-1,sizeof(k)); int flag=0; for(int i=0; i<m; i++) for(int j=0; j<=m; j++) if(d[i].w>=k[j]) { k[j]=d[i].w; if(j+1>flag)flag=j+1; break; } cout<<flag<<endl; } return 0; }
1 0
- POJ 1065 Wooden Sticks
- poj 1065 Wooden Sticks
- poj 1065 Wooden Sticks
- poj 1065 Wooden Sticks
- poj 1065 Wooden Sticks
- POJ 1065 Wooden Sticks
- poj 1065 Wooden Sticks
- POJ-1065-Wooden Sticks
- POJ 1065 Wooden Sticks
- POJ 1065 Wooden Sticks
- poj 1065 Wooden Sticks
- poj 1065 Wooden Sticks
- poj 1065 Wooden Sticks
- POJ 1065:Wooden Sticks
- POJ 1065 Wooden Sticks
- POJ - 1065 Wooden Sticks
- POJ 1065:Wooden Sticks
- poj 1065 Wooden Sticks
- 文件系统扫描的工具类
- MyEclipse2014 优化设置
- ZOJ 1860:Dog & Gopher
- ___19__C#手动编写Stack类,模拟栈的数据操作
- 如何防止android app被kill
- POJ 1065:Wooden Sticks
- Unicon字符串转成汉字String
- 【已解决】找不到android.support.v7.internal.app.WindowDecorActionbar
- callBackName cannot be found&fullPathForFilename: No file found at replay.png. 解决方案
- 优化Myeclipse启动速度
- 小C公众帮 获取微信公众号粉丝openid
- 恭贺新春,猴年大吉!
- 自定义tabbar(纯代码)
- fedora 23问题、fedoa 22 virtualbox 5.0安装