HDU1160 FatMouse's Speed（Jan. 17th, 2019） LIS路径输出

// La Pluie
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 1e3 + 5;
struct node{
    int m, v, id;
} p[N];
bool pluie(node x, node y){
    return x. m == y. m ? x. v < y. v : x. m > y. m;
}
int f[N], adv[N];
int main(){
//  freopen("testdata.txt", "r", stdin);
    printf("%d", adv[1000]);
    int n = 1;
    while(scanf("%d%d", &p[n]. m, &p[n]. v)!=EOF){
        p[n]. id = n; // 此处不可简写为 p[n]. id = n++，因为赋值语句从右至左执行，会出错 
        n++;
    }
    n--; sort(p + 1, p + n + 1, pluie);
    p[0] = (node){1e9, 0, 0};
    int root = 0;
    for(int i = 1; i <= n; i++){
        f[i] = 0;
        for(int j = 0; j < i; j++){
            if(p[i]. m < p[j]. m && p[i]. v > p[j]. v){
                if(f[i] <= f[j] + 1){
                    f[i] = f[j] + 1;
                    adv[i] = j;
                    if(f[root] < f[i]) root = i;
                }
            }
        }
    }
    printf("%d\n", f[root]);
    while(adv[root]){
        printf("%d\n", p[root]. id);
        root = adv[root];
    }
    printf("%d", p[root]. id);
    return 0;
}