HDU-1160
来源:互联网 发布:耳机线材淘宝 编辑:程序博客网 时间:2024/06/06 06:56
FatMouse's Speed
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16432 Accepted Submission(s): 7264
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将其中一个进行排序 然后就是求最长递增子序列的问题了用结构体typedef struct Data{int x;int y;int count;};其中count 为每个参数的初始位置AC代码:#include#include #include #includeusing namespace std;#define Maxn 1005typedef struct Data{int x;int y;int count;};Data a[Maxn];int dp[Maxn];int num[Maxn][Maxn];bool operator <(const Data &a,const Data &b){return (a.x Max){Max=dp[i];tmp=i;}}printf("%d\n",Max);for(int i=1;i<=Max;i++){printf("%d\n",num[tmp][i]);}return 0;}
阅读全文
0 0
- hdu 1160
- hdu 1160
- HDU 1160
- HDU 1160
- hdu 1160
- HDU 1160
- HDU 1160
- HDU 1160
- hdu 1160
- hdu 1160
- HDU-1160
- HDU 1160
- hdu 1160
- HDU 1160
- HDU 1160 动态规划
- hdu 1160 排序
- hdu 1160 dp
- (1160)HDU-类LIS
- (干货)序列化与反序列化的实现,一目了然。
- ThinkPHP的RBAC(基于角色权限控制)详解
- 在mac 安装wget ,使用wget 命令
- HDU 1247 Hat’s Words (Trie)
- mysql安装
- HDU-1160
- 多生产者多消费者问题
- 旅游类APP-Android模块分析
- DB modeling-DB Schema
- xamarin android使用zxing扫描二维码
- java开发图片水印
- 170706 逆向-南邮CTF平台(1-3)
- ?104. Maximum Depth of Binary Tree(C++)
- structs2的一些理解