hdu1160 dp+路径记录
来源:互联网 发布:袁炜事件 知乎 编辑:程序博客网 时间:2024/05/30 05:10
FatMouse's Speed
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12849 Accepted Submission(s): 5641
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
思路:
最长上升子序列。
路径记录是关键。
之前用这种方法输出结果wa了:
int k=1,pre=-1;for(int i=1;i<=cnt&&k<=len;i++){if(dp[i]==k){if(pre==-1||(st[i].s!=st[pre].s&&st[i].w!=st[pre].w)){printf("%d\n",st[i].id);pre=i;k++;}}}
这种情况还是有可能包括速度或者质量相同的, 因为dp[i]==k的老鼠会存在多个。
代码:
#include<cstdio>#include<algorithm>#include<cstring>using namespace std;const int N=1005;struct node{ int w,s; int id;}st[N];int dp[N],pre[N];//pre[i] 表示第i只老鼠前面老鼠的下标bool cmp(node n1,node n2){ return n1.s>n2.s;}int main(){ int s,w; int cnt=0; while(~scanf("%d%d",&w,&s)){ st[++cnt].w=w; st[cnt].s=s; st[cnt].id=cnt; } memset(pre,-1,sizeof(pre)); sort(st+1,st+cnt+1,cmp); int len=0,li; for(int i=1;i<=cnt;i++){ dp[i]=1; for(int j=1;j<i;j++) if(st[j].w<st[i].w&&st[i].s!=st[j].s){ if(dp[j]+1>dp[i]) pre[i]=j,dp[i]=dp[j]+1; } if(dp[i]>len) len=dp[i],li=i; } printf("%d\n",len); int prin[N]; int t=len; while(li!=-1){ prin[t--]=li; li=pre[li]; } for(int i=1;i<=len;i++){ printf("%d\n",st[prin[i]].id); } return 0;}
0 0
- hdu1160 dp+路径记录
- hdu1160 FatMouse's Speed--DP&记录路径
- hdu1160(记录路径)
- hdu1160 FatMouse's Speed (dp,记录路径)
- HDU1160 FatMouse's Speed(DP+路径记录)
- HDU1160-LIS&路径记录-J
- hdu1160 FatMouse's Speed 最长上升子序列以及记录路径 DP
- DP入门--HDU1160
- dp求顺序hdu1160
- HDU DP记录路径
- hdu1160
- hdu1160
- poj 1141【dp--记录路径】
- poj3003&2397 DP 记录路径
- 记录路径dp-4713-Permutation
- usaco buylow dp+记录路径
- poj1141(区间dp+记录路径)
- poj1141区间dp路径记录
- LINUX警告:检测到时钟错误。您的创建可能是不完整的。-转
- JAVAExecel大数据导出
- 【Android Tip 01】ClassLoader、Android Framework ClassLoader、App ClassLoader
- 如果编程语言是女孩子……
- 单片机C语言任何位置跳转到任何指定地址 -转
- hdu1160 dp+路径记录
- Linux串口编程-转
- opencv3.0在VS2013中的配置+window7(32)位
- iOS角标
- mapreduce 执行过程2
- MySQL数据类型不一致查询遇到的情况
- Ubuntu有了第一个全球CDN更新源
- C语言宏的高级应用-转
- 浅谈Qt代理