HDU 1160 FatMouse's Speed

 1 //#define LOCAL
 2 #include <iostream>
 3 #include <cstdio>
 4 #include <cstring>
 5 #include <algorithm>
 6 using namespace std;
 7 
 8 struct Mouse
 9 {
10     int order;
11     int weight;
12     int speed;
13     int pre;
14     int lenth;
15 }mice[1010];
16 
17 int a[1010];
18 
19 bool cmp1(Mouse a, Mouse b)
20 {
21     if(a.weight != b.weight)
22         return (a.weight > b.weight);
23     return (a.speed < b.speed);
24 }
25 
26 bool cmp2(Mouse a, Mouse b)
27 {
28     return (a.order < b.order);
29 }
30 
31 int main(void)
32 {
33     #ifdef LOCAL
34         freopen("1160in.txt", "r", stdin);
35     #endif
36 
37     int cnt = 0;
38     int w, s;
39     while(scanf("%d%d", &w, &s) == 2)
40     {
41         mice[cnt].weight = w;
42         mice[cnt].speed = s;
43         mice[cnt].order = cnt;
44         ++cnt;
45     }
46 
47     sort(mice, mice+cnt, cmp1);
48     int i, j;
49     for(i = 0; i < cnt; ++i)
50     {
51         mice[i].lenth = 1;
52         mice[i].pre = -1;
53     }
54     //我为人人
55     for(i = 1; i < cnt; ++i)
56     {
57         for(j = 0; j < i; ++j)
58         {
59             if(mice[j].weight > mice[i].weight 
60                 && mice[j].speed < mice[i].speed
61                 && mice[j].lenth+1 > mice[i].lenth)
62             {
63                 mice[i].lenth = mice[j].lenth + 1;
64                 mice[i].pre = mice[j].order;
65             }
66         }
67     }
68 
69     sort(mice, mice+cnt, cmp2);
70     int maxlen = 0;
71     for(i = 1; i < cnt; ++i)
72         if(mice[i].lenth > mice[maxlen].lenth)
73             maxlen = i;
74     int l = mice[maxlen].lenth;
75     printf("%d\n%d\n", l, maxlen+1);
76     
77     int p = maxlen;
78     for(i = 1; i < l; ++i)
79     {
80         printf("%d\n", mice[p].pre+1);
81         p = mice[p].pre;
82     }
83     return 0;
84 }