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
给出老鼠的体重和速度
求最长的序列,使得体重递增,速度递减
但是虽然题意是这样,但是还是会有体重不是递减但是却Ac的情况,可能是后台数据有问题吧
其实看代码就能知道怎么输出元素了
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e6+10;
const int INF=0x3f3f3f3f;
#define rep(i,a,b) for(int i=a;i<=b;i++)
struct node
{
int w,sp;
int id;
bool operator < (const node & a) const{
if(a.w==w) return a.sp>sp;
return a.w<w;
}
}num[2000];
int pre[1010];
int point[1010];
int dp[1010];
int main()
{
int k=1;
while(scanf("%d%d",&num[k].w,&num[k].sp)!=EOF){num[k].id=k;k++;}
sort(num+1,num+1+k);
memset(dp,0,sizeof dp);
memset(pre,-1,sizeof pre);
int ans=0;
int st=0;
rep(i,1,k)
{
dp[i]=1;
rep(j,1,i-1)
{
if(num[i].w<num[j].w&&num[i].sp>num[j].sp)
if(dp[j]+1>dp[i])
{
dp[i]=dp[j]+1;
pre[i]=j;
}
}
if(ans<dp[i])
{
ans=dp[i];
st=i;
}
}
int tot=1;
printf("%d\n",ans);
while(st!=-1)
{
point[tot++]=num[st].id;
st=pre[st];
}
rep(i,1,ans)
printf("%d\n",point[i]);
return 0;
}