hdu 1160 排序+下降子序列变形 FatMouse's Speed
来源:互联网 发布:mac版解压rar软件 编辑:程序博客网 时间:2024/06/18 16:29
FatMouse's Speed
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
代码如下:
#include<cstdio>#include<iostream>#include<cstdio>#include<algorithm>#include<string.h> using namespace std;struct Node {int id,wei,speed;}data[1005];int dp[1010];int pre[1010];int cmp(Node a,Node b){return a.wei>b.wei;//反着排序,就可以直接用上升子序列的模板了,然后pre倒序输出,正好是需要的结果}int main(){int cnt=0;while(~scanf("%d%d",&data[cnt].wei,&data[cnt].speed)){data[cnt].id=cnt+1;cnt++;}sort(data,data+cnt,cmp);memset(pre,-1,sizeof(pre));for(int i=0;i<cnt;i++)dp[i]=1;for(int i=0;i<cnt;i++){for(int j=0;j<i;j++){if(data[j].wei>data[i].wei && data[j].speed<data[i].speed && dp[i]<dp[j]+1){dp[i]=dp[j]+1;pre[i]=j;//记录的是倒序的,后面倒着输出 }}}int ans=0;int p;for(int i=0;i<cnt;i++){if(dp[i]>ans){ans=dp[i];p=i;}}printf("%d\n",dp[p]);while(p!=-1){printf("%d\n",data[p].id);p=pre[p];}return 0;}
阅读全文
0 0
- hdu 1160 排序+下降子序列变形 FatMouse's Speed
- hdu 1160 FatMouse's Speed( 最长下降子序列 )
- HDU 1160 FatMouse's Speed(最长递减子序列变形)
- hdu-1160 FatMouse's Speed 【最长上升子序列】
- hdu 1160 FatMouse's Speed(最大上升子序列dp)
- HDU 1160 FatMouse's Speed (dp, 最长子序列)
- HDU 1160 FatMouse's Speed 最长上升子序列
- 暑期dp46道(13)——HDOJ 1160FatMouse's Speed 排序+最长严格下降子序列+回溯
- hdoj1160 FatMouse's Speed ( STL + 最长下降子序列 /DP)
- HDU1160 FatMouse's Speed(DP,最长下降子序列)
- hdu1160 FatMouse's Speed 最长下降子序列 及其打印
- HDU1160 - FatMouse's Speed(最长下降子序列+打印路径)
- hdu1160 FatMouse's Speed 最长下降子序列 动态规划
- hdu1160 FatMouse's Speed 【最长下降子序列+输出】
- HDU 1160 FatMouse's Speed(严格最长递减序列变形+输出)【输出路径模板】
- hdu 1160 FatMouse's Speed(最长递减子序列+输出路径)
- HDU 1160 FatMouse's Speed (最长上升子序列+记录路径)
- HDU 1160 FatMouse's Speed 最长上升子序列及记录路径DP
- 属于自己的Python爬虫思路
- javaGUI实现图片切换操作
- 最小二乘法(python)
- 神经网络里面的反向传播算法的解释
- 数据结构线性表
- hdu 1160 排序+下降子序列变形 FatMouse's Speed
- 数字货币的未来发展
- ubuntu安装faster r-cnn(caffe,python,only cpu)
- 【Matlab】输出字符串到控制台
- 设计模式之单例模式
- JVM内存布局、垃圾收集算法、volatile讲解
- Netty之轻量级对象池Recycler
- 删除操作要谨慎,最好不做
- recycleView中引用v4包出错处理