CodeForces 4D Mysterious Present(DP)
来源:互联网 发布:新ipad壁纸软件 编辑:程序博客网 时间:2024/05/22 02:28
题意:你有一张长宽为x,y的卡片同时有n个盒子,长宽分别为xi,yi。然后问你卡片最多塞多少层盒子并且把这些盒子按照从里到外输出。
思路:由于数据给小了,所以n^2的DP也是可以水过的~
#include<iostream>#include<cstdio>using namespace std;const int maxn = 5005;int x[maxn],y[maxn],dp[maxn];int p[maxn],n;int dfs(int a){if (dp[a])return dp[a];for (int i =1 ;i<=n;i++){if (x[a]<x[i] && y[a]<y[i])if (dfs(i)+1>dp[a]){p[a]=i;dp[a]=dfs(i)+1;}}return dp[a];}int main(){ scanf("%d",&n);for (int i = 0;i<=n;i++)scanf("%d%d",&x[i],&y[i]);int ans = dfs(0);printf("%d\n",ans);for (int i = p[0];i;i=p[i])printf("%d ",i);}
0 0
- CodeForces 4D Mysterious Present(DP)
- codeforces 4D D. Mysterious Present(dp)
- codeforces 4D. Mysterious Present
- codeforces 4D Mysterious Present
- Codeforces 4D. Mysterious Present
- codeforces 4D. Mysterious Present
- CodeForces 4D. Mysterious Present
- codeforces 4D Mysterious Present
- CodeForces 4D-Mysterious Present
- Codeforces#4D Mysterious Present
- Codeforces 4D Mysterious Present
- codeforces 4D Mysterious Present -- 动态规划
- CF#(4D)Mysterious Present(DP)
- Codeforces 4D Mysterious (DP)
- Codeforces 4D Mysterious Present dp和dfs dp还得多练
- Codeforces 4D Mysterious Present 求数对的最长上升序列 dp
- Codeforces Beta Round #4 (Div. 2 Only)D. Mysterious Present
- Codeforces Beta Round #4 (Div. 2 Only) D. Mysterious Present
- Number 类,是八大基本类型的 父类
- HDU 5137 How Many Maos Does the Guanxi Worth
- Java如何复制对象
- eclipse实现Java源代码查看配置是如何查看JDK安装路径
- poj 1995(快速幂)
- CodeForces 4D Mysterious Present(DP)
- Centos7 yum安装nginx
- 关于爱丽丝和鲍勃的宴后演讲
- Java学习资源
- 【json】数组和对象转换为json
- 分享一下最近收集的hadoop视频资料
- 内部跳转和外部跳转
- leetcode——225—— Implement Stack using Queues
- 1-100个数找出一个缺少的数