# hdu 1160 FatMouse's Speed（DP）

http://acm.hdu.edu.cn/showproblem.php?pid=1160

# FatMouse's Speed

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 13974    Accepted Submission(s): 6170
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
4
4
5
9
7

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<set>
#include<cmath>
#include<vector>
#include<map>
#include<stack>
using namespace std;
typedef long long ll;
const int maxn   = 1004;
struct  tmp
{
int w;
int v;
int id;
} node[maxn];
int pre[maxn];
bool cmp(const tmp&a,const tmp&b)
{
if(a.w==b.w)
return a.v<b.v;
return a.w<b.w;
}
int dp[maxn];
int main()
{
int cnt = 0;
memset(pre,-1,sizeof(pre));
int maxi = 0;
while(~scanf("%d%d",&node[cnt].w,&node[cnt].v)&&(node[cnt].id = cnt+1)&&++cnt);
sort(node,node+cnt,cmp);
//    for(int i = 0 ; i < cnt ; i ++)
//    {
//        cout << node[i].w <<' '<<node[i].v <<endl;
//    }
for(int i  = 0 ; i < cnt ; i ++)
{
dp[i] = 1;
for(int j = 0 ; j < i ; j ++)
{
if(node[j].v>node[i].v&&dp[i]<dp[j] + 1)
{
pre[i] = j;
dp[i] = dp[j] + 1;
}
}
if(dp[maxi]<dp[i])
maxi = i;
}
cout << dp[maxi]<<endl;
int ret = maxi;
stack<int>s;
s.push(node[ret].id);
while(pre[ret]!=-1)
{
s.push(node[pre[ret]].id);
ret = pre[ret];
}
while(!s.empty())
{
cout << s.top() <<endl;
s.pop();
}
return 0;
}


• 本文已收录于以下专栏：

## HDU 1160 FatMouse's Speed （dp+路径记录）

FatMouse's Speed Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others...

## DP-HDU-1160-FatMouse's Speed

FatMouse’s SpeedTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) ...

## （HDU - 1160）FatMouse's Speed（DP）

Time limit1000 msMemory limit32768 kBOSWindowsFatMouse believes that the fatter a mouse is, the fast...

## hdu 1160 FatMouse's Speed【dp】

FatMouse's Speed Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)...

## J - FatMouse's Speed HDU - 1160——基础dp

Think: 1知识点：排序+最长上升子串+记录路径 2题意：寻找一个最长子串，使得重量w严格递增，速度c严格递减 3反思：注意排序后的路径记录和通过递归回溯输出路径vjudge题目链接以下为A...

## HDU---1160-FatMouse's Speed （DP）

FatMouse's Speed Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) ...

举报原因： 您举报文章：深度学习：神经网络中的前向传播和反向传播算法推导 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)