FatMouse's Speed
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6929Accepted Submission(s): 3028
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.
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.
Sample Input
6008 1300
6000 2100
500 2000
1000 4000
1100 3000
6000 2000
8000 1400
6000 1200
2000 1900
Sample Output
先按体重 或 速度排序。
之后就是求其中的最大单调序列的长度了,这个是个很常见的问题了。
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
int opt[1001], trace[1001], ans[1001];
struct Node{
int w,p,index;
};
bool cmp(const Node & a, const Node & b){
return a.w < b.w;
}
Node mice[1001];
int main() {
//freopen("in.txt", "r", stdin);
int k = 0;
while(cin >> mice[k].w >> mice[k].p){
mice[k].index = k+1;
k++;
}
memset(opt, 0 ,sizeof(opt));
memset(trace, 0 ,sizeof(trace));
sort(mice, mice+k, cmp);
int tmax = 0,index;
for(int i=1; i<k; i++){
for(int j=0; j<i; j++){
if(mice[i].p < mice[j].p && mice[i].w > mice[j].w){
if(opt[j] + 1 > opt[i]){
opt[i] = opt[j] + 1;
// trace[i] = mice[j].index;
trace[i] = j;
}
}
}
if(opt[i] > tmax){
tmax = opt[i];
index = i;
}
}
for(int i=tmax; i>=0; i--){
ans[i] = mice[index].index;
index = trace[index];
}
// for(int i=0; i<k; i++)
// cout << opt[i] << " ";
// cout << endl;
// for(int i=0; i<k; i++)
// cout << trace[i] << " ";
// cout << endl;
cout <<tmax+1 << endl;
for(int i=0; i<=tmax; i++)
cout << ans[i] << endl;
return 0;
}
分享到:
相关推荐
动态规划: 1011 NTA 简单题 1013 Great Equipment 简单题 1024 Calendar Game 简单题 1027 Human Gene Functions 简单题 1037 Gridland 简单题 1052 Algernon s Noxious Emissions 简单题 1409 ...
FatMouse' Trade问题主要是说一只老鼠有M磅猫食,然后在N个房间里面用猫食换JavaBean,房间i中有F[i]磅的猫食来换J[i]磅的JavaBean,而且老鼠可以在一个房间里根据一定比例a%来换取JavaBean. 问:如何兑换,才能使得...
1001 计算直线的交点数 1002 FatMouse's Speed1003 Common Subsequence1004 Max Sum 1005 Super Jumping! Jumping! Jumping! 1006 免费馅饼 1007 Humble Numbers1008 Monkey and Banana 1009 龟兔赛跑 1010 数塔
PJBlog2 FatMouse模板
C++的P1,又需要的人请下,很简单,但是是c++的入门程序
动态规划: 1011 NTA 简单题 1013 Great Equipment 简单题 1024 Calendar Game 简单题 1027 Human Gene Functions 简单题 1037 Gridland 简单题 1052 Algernon s Noxious Emissions 简单题 1409 ...
PJBlog2 两个人的世界
翁凯java课件 FatMouse