zoj 1108 FatMouse's Speed

按体重升序排序，求速度最长下降子序列并记录路径

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
#define ls rt<<1
#define rs ls1
#define lson l,mid,ls
#define rson mid+1,r,rs
#define middle (l+r)>>1
#define eps (1e-9)
#define type int
#define clr_all(x,c) memset(x,c,sizeof(x))
#define clr(x,c,n) memset(x,c,sizeof(x[0])*(n+1))
#define MOD 1000000007
#define inf 0x3f3f3f3f
#define pi acos(-1.0)
#define M 1000+5
struct node{
int w,s,n;
}a[M];
int dp[M],path[M],n; 
int cmp(node x,node y){
if(x.w<y.w)return 1;
else if(x.w>y.w)return 0;
else {
if(x.s>y.s)return 1;
else return 0;
}
}
void printPath(int x){
if(path[x]!=0)printPath(path[x]);
printf("%d\n",x);
return ;
}
void solve(){
int i,j,t,max,x;
memset(path,0,sizeof(path));
for(i=1;i<=n;i++)dp[i]=1;
for(i=2;i<=n;i++)
for(j=1;j<i;j++)
if(a[i].w>a[j].w&&a[i].s<a[j].s)
if(dp[j]+1>dp[i]){ 
dp[i]=dp[j]+1;
path[a[i].n]=a[j].n;
}
max=-1;
for(i=1;i<=n;i++){
if(dp[i]>max)max=dp[i],x=a[i].n;
}
printf("%d\n",max);
printPath(x);
}
int main(){
    int i=1,j,x,f;
    while(~scanf("%d %d",&a[i].w,&a[i].s)){
a[i].n=i;
i++;
}
    n=i;
    sort(a+1,a+n+1,cmp);
    solve();
    return 0;
}