hdu 1160 FatMouse's Speed 解题报告

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstdlib>
 4 #include <cstring>
 5 #include <algorithm>
 6 using namespace std;
 7 
 8 const int maxn = 1000 + 10;
 9 
10 struct node
11 {
12     int id;
13     int weight, speed;
14 }mouse[maxn];
15 int path[maxn];
16 int cnt[maxn];
17 
18 int cmp(node a, node b)
19 {
20     if (a.weight == b.weight)
21         return a.speed > b.speed;
22     return a.weight < b.weight;
23 }
24 
25 void output(int pos)
26 {
27     if (!path[pos])
28         return;
29     output(path[pos]);
30     printf("%d\n", path[pos]);
31 }
32 
33 int main()
34 {
35     int w, sp, len = 1;
36     #ifndef ONLINE_JUDGE
37         freopen("in.txt", "r", stdin);
38     #endif
39 
40     while (scanf("%d%d", &w, &sp) != EOF)
41     {
42         mouse[len].weight = w;
43         mouse[len].speed = sp;
44         mouse[len].id = len;
45         cnt[len++] = -1;
46     }
47     sort(mouse+1, mouse+len, cmp);
48     for (int i = 1; i < len; i++)
49     {
50         int k = 0;
51         for (int j = 1; j < i; j++)
52         {
53             if (mouse[j].speed > mouse[i].speed && mouse[j].weight < mouse[i].weight && k < cnt[j])
54             {
55                 k = cnt[j];
56                 path[mouse[i].id] = mouse[j].id;
57             }
58         }
59         cnt[i] = k;
60         cnt[i]++;
61     }
62     int ansid, ans = -1;
63     for (int i = 1; i < len; i++)
64     {
65         if (cnt[i] > ans)
66         {
67             ans = cnt[i];
68             ansid = mouse[i].id;
69         }
70     }
71     printf("%d\n", ans);
72     output(ansid);
73     printf("%d\n", ansid);
74     return 0;
75 }