hdoj_1160FatMouse's Speed
来源:互联网 发布:微信开发框架java 编辑:程序博客网 时间:2024/06/06 03:09
FatMouse's Speed
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5806 Accepted Submission(s): 2504
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 //=.=#include <iostream>#include <cstring>#include <cstdio>#include <algorithm>using namespace std;struct Point{int weight;int speed;int num;int pre;}mice[1005];bool cmp(Point a, Point b){if(a.weight == b.weight) return a.speed > b.speed;else return a.weight < b.weight;}//void output(int k)//{//if(k<=0) return;//output(mice[k].pre);//cout<<mice[k].num<<endl;//}int main(){freopen("E:\\ACM\\HDOJ\\hdoj_1160\\in.txt","r",stdin);int i, j, v = 1, flag, max;int dp[1005] = {0};while(scanf("%d %d", &mice[v].weight, &mice[v].speed)!=EOF){mice[v].num = v++;}v--;sort(mice+1, mice+v+1, cmp);max = 0;for(i = 1; i <= v; i++){dp[i] = 1;for(j = 1; j < i; j++){if(mice[i].weight > mice[j].weight && mice[i].speed < mice[j].speed && dp[j] +1 > dp[i] ){dp[i] = dp[j] + 1;mice[i].pre = j;if(dp[i] > max){max = dp[i];flag = i;}}}}cout << max << endl;int ans[1005];j = 1;for( i = 1; i <= max; i++){ans[j++] = mice[flag].num;flag = mice[flag].pre;}for( i = max; i >= 1; i--){cout<<ans[i]<<endl;}return 0;}
- hdoj_1160FatMouse's Speed
- FatMouse's Speed
- zoj_1108 Fatmouse's Speed
- 【DP】FatMouse's Speed
- FatMouse's Speed(dp)
- FatMouse's Speed
- 1160FatMouse's Speed
- FatMouse's Speed
- HDU1160--FatMouse's Speed
- FatMouse's Speed
- ZOJ1108 FatMouse's Speed
- FatMouse's Speed
- hdu FatMouse's Speed
- HDU1160 FatMouse's Speed
- HDU1160FatMouse's Speed
- HDU1160 FatMouse's Speed
- FatMouse's Speed
- FatMouse's Speed
- ArcGIS Engine基础开发教程(5)——学习地图查询
- oracle rowid与rownum的使用
- 算法导论-数据结构的扩张
- OK6410移植UBOOT 2012.10全部过程
- Heritrix1.14源码分析(2) 配置文件order.xml介绍
- hdoj_1160FatMouse's Speed
- 深入Linux网络编程(三):异步阻塞IO—epoll
- C++中的多继承
- Heritrix1.14源码分析(3) 修改配置文件order.xml加快你的抓取速度
- allegro.cfg文件不能打开
- python操作MongoDB
- VC++中的string 用法
- Heritrix1.14源码分析(4)各个类说明
- 结构和类的区别