FatMouse's Speed——J
2016-03-20 21:21
225 查看
J. FatMouse's Speed
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.
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],..., mthen it must be the case that
W[m[1]] < W[m[2]] < ... < W[m
]
and
S[m[1]] > S[m[2]] > ... > S[m
]
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 1300 6000 2100 500 2000 1000 4000 1100 3000 6000 2000 8000 1400 6000 1200 2000 1900
Sample Output
4 4 5 9 7
题意:
要求找到的体重递增,速度递减的老鼠,并且输出最长的长度数,而且输出各自的序列数。(Special Judge 说明答案不唯一,只要输出的答案正确就可以)
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; struct node { int num,w,s; }a[1005]; int cmp(node c,node d) {return c.w<d.w;} int x,y,k,t[1005],r[1005]; int main() { int i,j,L,p=0,ant=1,er=1; k=0; memset(t,0,sizeof(t)); while(cin>>x>>y) { a[k].num=k+1; a[k].w=x; a[k].s=y; k++; } sort(a,a+k,cmp); for(i=0;i<k;i++) t[i]=1; for(i=1;i<k;i++) { for(j=0;j<i;j++) { if(a[j].s>a[i].s&&a[j].w<a[i].w&&t[i]<t[j]+1) t[i]+=1; } } for(i=0;i<k;i++) p=max(p,t[i]); cout<<p<<endl; for(i=0;i<k;i++) { if(p==t[i]) j=i; } int temp=j; r[er++]=a[j].num; for(L=j-1;L>=1;L--) { if(t[L]+1==t[j]&&a[L].s>a[temp].s) { ant++; r[er++]=a[L].num; t[j]=t[L]; temp=L; } if(ant==p) break; } for(i=er-1;i>0;i--) cout<<r[i]<<endl; return 0; }
相关文章推荐
- 数据库-mongodb-Gridfs
- 代码复审
- 读书笔记 |Google C++编程风格指南
- 2.2-kvm虚拟磁盘扩容
- 《华为研发》 张利华
- cwrsync invalid uid nobody 解决方法
- hibernate中的一对一映射配置详解
- 横竖屏的生命周期
- 20145239杜文超 《Java程序设计》第3周学习总结
- 代码规范
- POJ 1845
- jquery data attr val 用法
- Tkinter -- Statusbar
- 字节对齐与内存访问
- CF651B-Beautiful Paintings
- eclipse 是用来写客户端的,MyEclipse 是用来写服务器端的,谐音记忆法,My 买,买服务器这样就好记了。
- 看懂redis的配置
- hdu2699 Five in a Row 暴力穷举
- Git中三种文件状态及其转换(转)
- python爬虫 前程无忧网页抓取