HDU 1160 FatMouse's Speed (dp+路径记录)
来源:互联网 发布:淘宝头像设计制作 编辑:程序博客网 时间:2024/06/04 22:47
传送门:点击打开链接
FatMouse's Speed
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16972 Accepted Submission(s): 7507
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.
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.
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 13006000 2100500 20001000 40001100 30006000 20008000 14006000 12002000 1900
Sample Output
44597
题意是让求体重严格递增,速度严格递减的老鼠,并且输出老鼠的位置,表示没看到Special Judge,一直调不出示例结果,后来觉得自己很对,提交竟然A到。
可以按照体重递增排序,用dp[i]数组表示前i个老鼠中,有多少个是符合题目要求的,用path数组记录当前数组的前一个的值,使用结构体记录老鼠的初始位置。path数组初始化为每一个老鼠都只能到达本身,最后倒序输出。典型的dp模板题,就是多了路径记录。
代码实现:
#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>using namespace std;const int maxn=1e5+5;struct mouse{int weight;int feed; //英语不好,不要在意细节,好像应该是speed int count;}p[maxn];int cmp(mouse a,mouse b){if(a.weight==b.weight)return a.feed<b.feed;return a.weight<b.weight;}int dp[maxn],path[maxn],ans[maxn];int main(){int i=0,j,k=0;while(cin>>p[i].weight){cin>>p[i].feed;p[i].count=++k;i++;}memset(dp,0,sizeof(dp));sort(p,p+i,cmp);int n=i;for(i=0;i<n;i++)path[i]=i;int maxx=-1,index=0;for(i=0;i<n;i++){dp[i]=1;for(j=0;j<i;j++){if(p[i].weight>p[j].weight&&p[i].feed<p[j].feed&&dp[i]<dp[j]+1){dp[i]=dp[j]+1;path[i]=j;if(dp[i]>maxx){maxx=dp[i];index=i;}}}}cout<<maxx<<endl;k=0;while(path[index]!=index){ans[k++]=p[index].count;index=path[index];}ans[k++]=p[index].count;for(i=k-1;i>=0;i--)cout<<ans[i]<<endl;return 0;}
阅读全文
0 0
- HDU 1160 FatMouse's Speed (dp+路径记录)
- hdu 1160 FatMouse's Speed dp记录路径
- HDU 1160 FatMouse's Speed (基础dp路径记录)
- FatMouse's Speed(HDU 1160)—— DP记录路径
- HDU 1160 FatMouse's Speed(LIS+记录路径)
- hdu 1160 FatMouse's Speed (DP)
- 【HDU】 1160 FatMouse's Speed (DP)
- HDU---1160-FatMouse's Speed (DP)
- HDU 1160 FatMouse's Speed(DP)
- hdu 1160 FatMouse's Speed(DP)
- HDU 1160 FatMouse's Speed (dp)
- hdu1160 FatMouse's Speed--DP&记录路径
- hdu1160 FatMouse's Speed (dp,记录路径)
- HDU1160 FatMouse's Speed(DP+路径记录)
- HDU 1160 FatMouse's Speed 最长上升子序列及记录路径DP
- 【DP|LIS+输出路径】HDU-1160 FatMouse's Speed
- HDU 1160 FatMouse's Speed DP 路径回溯
- hdu FatMouse's Speed(DP)(打印路径)
- 不重复数字求和
- 层级问题,z-index的使用说明
- C++读取特定路径下文件目录及文件名称
- spring详解:使用注解方式注入属性
- FTPS 与SFTP大对决
- HDU 1160 FatMouse's Speed (dp+路径记录)
- 1.2 快速掌握 Android 中的六大布局
- 精通css 第六章 (2)图片热点定位
- 相等测试与继承-equals
- 【SpringMVC-003】idea创建SpringMVC项目傻瓜教程-URL传值
- PPEasy(P2P+流媒体)传输系统简介
- iOS 11 新API的多种代码示例
- HDU_6069 Counting Divisors 【数论】
- ListView详解