poj1609 Tiling Up Blocks
来源:互联网 发布:免费手机库存软件 编辑:程序博客网 时间:2024/05/21 22:46
Tiling Up Blocks
Time Limit: 1000MS
Memory Limit: 10000K
Description
Michael The Kid receives an interesting game set from his grandparent as his birthday gift. Inside the game set box, there are n tiling blocks and each block has a form as follows:
Each tiling block is associated with two parameters (l,m), meaning that the upper face of the block is packed with l protruding knobs on the left and m protruding knobs on the middle. Correspondingly, the bottom face of an (l,m)-block is carved with l caving dens on the left and m dens on the middle.
It is easily seen that an (l,m)-block can be tiled upon another (l,m)-block. However,this is not the only way for us to tile up the blocks. Actually, an (l,m)-block can be tiled upon another (l',m')-block if and only if l >= l' and m >= m'.
Now the puzzle that Michael wants to solve is to decide what is the tallest tiling blocks he can make out of the given n blocks within his game box. In other words, you are given a collection of n blocks B = {b1, b2, . . . , bn} and each block bi is associated with two parameters (li,mi). The objective of the problem is to decide the number of tallest tiling blocks made from B.
Input
Several sets of tiling blocks. The inputs are just a list of integers.For each set of tiling blocks, the first integer n represents the number of blocks within the game box. Following n, there will be n lines specifying parameters of blocks in B; each line contains exactly two integers, representing left and middle parameters of the i-th block, namely, li and mi. In other words, a game box is just a collection of n blocks B = {b1, b2, . . . , bn} and each block bi is associated with two parameters (li,mi).
Note that n can be as large as 10000 and li and mi are in the range from 1 to 100.
An integer n = 0 (zero) signifies the end of input.
Output
For each set of tiling blocks B, output the number of the tallest tiling blocks can be made out of B. Output a single star '*' to signify the end of
outputs.
Sample Input
3
3 2
1 1
2 3
5
4 2
2 4
3 3
1 1
5 5
0
Sample Output
2
3
*
题意:最长不增序列长度
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <cstring>
using namespace std;
struct node
{
int x,y;
}p[50005];
int dp[50005];
int cmp(node qq,node ww)
{
if(qq.x!=ww.x)
return qq.x>ww.x;
else
return qq.y>ww.y;
}//按照从大到小排序 第一个数相同时 按第二个数从大到小排
int main()
{
int n;
while(cin>>n)
{
if(n==0)
{
cout<<"*"<<endl;
break;
}
memset(dp,0,sizeof(dp));
for(int i=0;i<n;i++)
{
cin>>p[i].x>>p[i].y;
}
sort(p,p+n,cmp);
dp[0]=1;
for(int i=1;i<n;i++)
{
dp[i]=1;
for(int j=0;j<i;j++)
{
if(p[j].y>=p[i].y)
dp[i]=max(dp[i],dp[j]+1);//以第二个数为结尾的最长不增序列长度
}
}
int ans=0;
for(int i=0;i<n;i++)
{
ans=max(ans,dp[i]);
}
cout<<ans<<endl;
}
return 0;
}
- poj1609 Tiling Up Blocks
- POJ1609 Tiling Up Blocks
- poj1609 Tiling Up Blocks
- POJ1609:Tiling Up Blocks(DP)
- poj1609 - Tiling Up Blocks(动归)
- poj1609——Tiling Up Blocks
- poj1609 Tiling Up Blocks(LIS)
- POJ1609 UVALive2815 UVA1196 ZOJ1787 Tiling Up Blocks【二维最长上升子序列+DP】
- pku1609 Tiling Up Blocks
- Tiling Up Blocks (LIS)
- poj 1609 Tiling Up Blocks
- POJ 1609 Tiling Up Blocks.
- poj 1609 Tiling Up Blocks
- 1609 Tiling Up Blocks 解题报告
- pku1609 Tiling Up Blocks (DP题)
- poj 1609 Tiling Up Blocks 动态规划
- Tiling Up Blocks - POJ 1609 dp
- poj 1609 Tiling Up Blocks(DP)
- 【JavaEE学习笔记】数据库建模
- 最短路径变型题解法举例
- Java源码之HashMap
- matlab 结构数组
- 下载和安装Python语言
- poj1609 Tiling Up Blocks
- Android Volley+OkHttp3+Gson 开源库的封装
- MySQL与Python3交互之安装引入pymysql模块
- java基础---目录
- 一:Python介绍
- 计算机组成与设计(软件/硬件接口)笔记
- ClassLoader类加载机制
- 2-Druid架构-Druid white paper
- 关系型数据库