杭电HDOJ 1160 解题报告
来源:互联网 发布:浙江省乡村旅游数据 编辑:程序博客网 时间:2024/06/05 20:56
FatMouse's Speed
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6632 Accepted Submission(s): 2898
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
Source
Zhejiang University Training Contest 2001
Recommend
Ignatius
这是一道DP的题目,之前已经上了好几题DP的了。。。继续。
解题思路:
对W或S排序后,对另一个进行DP。
(未完待续,下次上图说明)
代码:
#include <stdio.h>int main(int argc, const char * argv[]){ int a[1005],b[1005],c[1005],d[1005],i,j,k,t,m=0,w,v[1005]={-1}; i=0; while(scanf("%d",&a[i])!=EOF/*&&a[i]!=0*/) { scanf("%d",&b[i++]); } //sort for(j=0;j<i;j++) { t=0; for(w=0;w<i;w++) { if(a[w]>t) { t=a[w]; k=w; } } c[m++]=k; a[k]=0; } //find max for(j=0;j<i;j++) { k=c[j]; w=j; if(j==0) {d[k]=1;v[k]=-1;} else{ m=1; for(t=c[w-1];w>=0;w--) { t=c[w-1]; if(b[k]>b[t]) {if(d[t]>=m) {m=d[t]+1;v[k]=t;}} } d[k]=m;if(m==1) v[k]=-1; } } // output t=0; for(j=0;j<i;j++) { k=c[j]; if(d[k]>t) {t=d[k];w=c[j];} } printf("%d\n",t); //print printf("%d\n",w+1); while(d[w]!=1){ w=v[w]; if(w==-1) break; printf("%d\n",w+1); } return 0;}
- 杭电HDOJ 1160 解题报告
- 杭电HDOJ 2084 解题报告
- 杭电HDOJ 1159 解题报告
- 杭电HDOJ 1000 解题报告
- 杭电HDOJ 1001 解题报告
- 杭电HDOJ 1002 解题报告
- 杭电HDOJ 1003 解题报告
- 杭电HDOJ 1042 解题报告
- 杭电HDOJ 1040 解题报告
- 杭电HDOJ 1061 解题报告
- 杭电HDOJ 1097 解题报告
- 杭电1160解题报告
- 杭电1008解题报告
- 杭电1014解题报告
- 杭电1176解题报告
- 杭电2059解题报告
- 杭电HDOJ1024 解题报告
- 杭电2028解题报告
- excel批量导入数据
- 浅谈php处理session
- Objective C内存管理进阶(一):实践准则
- 类模板的继承
- 引用数据类型
- 杭电HDOJ 1160 解题报告
- Mysql中文乱码问题完美解决方案
- HDU3397--Sequence operation
- 我姐和我女友这样学编程
- 【模式匹配】之——多模匹配 下篇(AC算法之前缀树实现)
- C++中的pair
- hdu 1248 寒冰王座
- 获取ip的经纬度
- Nand Flash详解