hdu1677 Nested Dolls(贪心)
来源:互联网 发布:最新微信家校通源码 编辑:程序博客网 时间:2024/06/05 04:39
Nested Dolls
http://acm.hdu.edu.cn/showproblem.php?pid=1677
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2286 Accepted Submission(s): 655Problem Description
Dilworth is the world’s most prominent collector of Russian nested dolls: he literally has thousands of them! You know, the wooden hollow dolls of different sizes of which the smallest doll is contained in the second smallest, and this doll is in turn contained in the next one and so forth. One day he wonders if there is another way of nesting them so he will end up with fewer nested dolls? After all, that would make his collection even more magnificent! He unpacks each nested doll and measures the width and height of each contained doll. A doll with width w1 and height h1 will fit in another doll of width w2 and height h2 if and only if w1 < w2 and h1 < h2. Can you help him calculate the smallest number of nested dolls possible to assemble from his massive list of measurements?
Input
On the first line of input is a single positive integer 1 <= t <= 20 specifying the number of test cases to follow. Each test case begins with a positive integer 1 <= m <= 20000 on a line of itself telling the number of dolls in the test case. Next follow 2m positive integers w1, h1,w2, h2, . . . ,wm, hm, where wi is the width and hi is the height of doll number i. 1 <= wi, hi <= 10000 for all i.
Output
For each test case there should be one line of output containing the minimum number of nested dolls possible.
Sample Input
4320 30 40 50 30 40420 30 10 10 30 20 40 50310 30 20 20 30 10410 10 20 30 40 50 39 51
Sample Output
1232
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;struct ss{ int w,h;} s[20004],t[20004];bool cmp(ss a,ss b){ if(a.w==b.w) return a.h>b.h;//即使相等也不可套,既然要开辟新的一摞,不妨用较小的来开辟,再往上套的可能性会更大 return a.w<b.w;}int main(){ int cas,n,i,j,ans; scanf("%d",&cas); while(cas--) { memset(t,0,sizeof(t)); scanf("%d",&n); for(i=0; i<n; i++) scanf("%d%d",&s[i].w,&s[i].h); sort(s,s+n,cmp); ans=0; for(i=0; i<n; i++) { j=0; while(s[i].w<=t[j].w||s[i].h<=t[j].h) j++; if(j>ans) ans=j; t[j]=s[i]; } printf("%d\n",++ans); } return 0;}
0 0
- hdu1677 Nested Dolls(贪心)
- hdu1677--Nested Dolls(贪心+LIS)
- hdu1677—Nested Dolls(贪心)
- Nested Dolls(hdu1677(LIS))
- HDU1677 Nested Dolls
- HDU1677:Nested Dolls
- hdu1677 Nested Dolls
- hdu1677 Nested Dolls Dilworth定理
- HDOJ 1677 Nested Dolls(贪心+LIS)
- HDU 1677 Nested Dolls (贪心)
- 【贪心】poj3636 nested dolls
- hdu1677(贪心+二分)
- hdu1257 最少拦截系统 hdu1677 Nested Dolls(最长上升子序列)
- Nested Dolls
- Nested Dolls
- Nested Dolls
- POJ3636 Nested Dolls ACM解题报告(暴力贪心(也可用二分查找降低复杂度))
- AYITACM2016省赛第三周A-Nested Dolls(贪心解嵌套问题)
- 理解同步与异步的概念
- Linux rpm 命令参数使用详解
- 【备忘录】MySQL中插入中文显示“???”的解决办法
- android画经过多点的曲线
- nginx写临时文件过程分析
- hdu1677 Nested Dolls(贪心)
- andriod Handler机制原理
- 1020. Tree Traversals
- 嵌入式系统开发的架构和应用
- 旋转
- 提示ADB server didn't ACK错误的解决方法
- 2014ACM集训13级PK赛4-80ers' Memory
- 常用PHP编辑器介绍
- Android开发中Intent意图对象使用方法