HDU-1160-FatMouse's Speed(最长单调递增子序列)
来源:互联网 发布:淘宝上怎么搜索订单号 编辑:程序博客网 时间:2024/05/07 16:52
FatMouse’s Speed
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 15259 Accepted Submission(s): 6724
Special Judge
Problem Description
FatMouse believes that the fatter a mouse is, the faster it runs. To disprove this, you want to take the data on a collection of mice and put as large a subset of this data as possible into a sequence so that the weights are increasing, but the speeds are decreasing.
Input
Input contains data for a bunch of mice, one mouse per line, terminated by end of file.
The data for a particular mouse will consist of a pair of integers: the first representing its size in grams and the second representing its speed in centimeters per second. Both integers are between 1 and 10000. The data in each test case will contain information for at most 1000 mice.
Two mice may have the same weight, the same speed, or even the same weight and speed.
Output
Your program should output a sequence of lines of data; the first line should contain a number n; the remaining n lines should each contain a single positive integer (each one representing a mouse). If these n integers are m[1], m[2],…, m[n] then it must be the case that
W[m[1]] < W[m[2]] < … < W[m[n]]
and
S[m[1]] > S[m[2]] > … > S[m[n]]
In order for the answer to be correct, n should be as large as possible.
All inequalities are strict: weights must be strictly increasing, and speeds must be strictly decreasing. There may be many correct outputs for a given input, your program only needs to find one.
Sample Input
6008 1300
6000 2100
500 2000
1000 4000
1100 3000
6000 2000
8000 1400
6000 1200
2000 1900
Sample Output
4
4
5
9
7
题意:给定很多组老鼠的体重和速度,找出体重递增速度递减的最大子集。
思路:首先速度降序排列,接着求体重的最长上升子序列即可。状态转移时记录路径,最后回溯输出序号即可。
代码
#include<stdio.h>#include<algorithm>#include<iostream>#include<string.h>using namespace std;const int maxn=100005;struct node{ int W;//升序 int S;//降序 int point;//下标};node num[maxn];int DP[maxn];//截止到第i个数,最长单调递增子序列的长度int path[maxn];//第i个数的上一个数是第path[i]个数int result[maxn];//存储结果序号bool cmp(node x,node y){ if(x.S==y.S) return x.W<y.W; return x.S>y.S;}int main(){ int len=1;//数据数量 while(scanf("%d%d",&num[len].W,&num[len].S)!=EOF) { num[len].point=len; len++; } sort(num+1,num+len+1,cmp);//按照S降序排列// for(int i=1;i<len;i++)// printf("%d***%d***%d\n",num[i].W,num[i].S,num[i].point);// memset(DP,0,sizeof(DP)); memset(path,-1,sizeof(path)); for(int i=1;i<len;i++) DP[i]=1; for(int i=1; i<len; i++) { for(int j=1; j<i; j++) { if(num[j].W<num[i].W&&num[j].S>num[i].S&&DP[j]+1>DP[i]) { DP[i]=DP[j]+1; path[i]=j; } } } int point=1; for(int i=1; i<len; i++) if(DP[i]>DP[point]) point=i; int len_result=0; for(int i=point;i!=-1;i=path[i]) result[len_result++]=num[i].point; printf("%d\n",DP[point]); for(int i=len_result-1;i>=0;i--) printf("%d\n",result[i]); return 0;}
- HDU-1160-FatMouse's Speed(最长单调递增子序列)
- (HDU 1160) FatMouse's Speed dp (最长递增子序列 , 两个因素决定)
- hdu 1160 FatMouse's Speed( 最长下降子序列 )
- HDU 1160 FatMouse's Speed (dp, 最长子序列)
- hdu 1160 FatMouse's Speed (最长单调递减子序列+纪录路径)
- HDU 1160 FatMouse's Speed--dP--(元素1递增元素2递降的最长子序列)
- hdu-1160 FatMouse's Speed 【最长上升子序列】
- HDU 1160 FatMouse's Speed 最长上升子序列
- HDU1160 FatMouse's Speed(DP,最长递增子序列)
- HDU 1160 FatMouse's Speed (最長單調递增子序列 dp)
- hdu 1160 FatMouse's Speed(最长递减子序列+输出路径)
- hdu 1160 FatMouse's Speed (dp---最长有序子序列)
- HDU 1160 FatMouse's Speed (最长有序的上升子序列)
- HDU 1160 FatMouse's Speed(最长上升子序列长度及其路径)
- J - FatMouse's Speed HDU 1160 (动态规划,最长上升子序列+路径输出)
- hdu 1160 FatMouse's Speed(最长递减子序列 (加强版) )
- hdu 1160 FatMouse's Speed (最长上升子序列 + 记录路径)
- HDU 1160 FatMouse's Speed(最长递减子序列变形)
- SAE上开发微信公众号
- 程序员的绩效之谜
- JSP、Servlet实战:团队开发新闻系统(七)腾讯新闻爬虫
- Xcode 6.3 代码调试
- win7 IIS发布MVC时,出现403的错误
- HDU-1160-FatMouse's Speed(最长单调递增子序列)
- spring boot aop 记录方法执行时间
- 什么是KBEngine
- plist文件里的"Bundle versions string, short" 跟 "Bundle version" 的区别及作用分别是什么?
- Result Set not updatable解决办法
- 设计模式之观察者模式
- 关于前端惰性加载(jquery_lazyload)的使用和原理分析
- apache禁止访问目录列表
- datatables后台分页 springMVC+MyBatis PageHelper分页