hdu-acm steps FatMouse's Speed

 1 #include"iostream"
 2 #include"stdio.h"
 3 #include"string.h"
 4 #include"cmath"
 5 #include"algorithm"
 6 #define mx 1005
 7 using namespace std;
 8 int cur[mx];
 9 int end1[mx];
10 struct node
11 {
12     int v;
13     int w;
14     int num;
15 }mice[mx];
16 node temp;
17 bool cmp(const node a,const node b)
18 {
19     if(a.w!=b.w) return a.w<b.w;
20     else return a.v>b.v;
21 }
22 int main()
23 {
24     int i,j,k,sum=0;
25   //  while(1){
26     while(scanf("%d%d",&mice[sum].w,&mice[sum].v)==2) {mice[sum].num=sum+1;sum++;}
27     sort(mice,mice+sum,cmp);
28     int maxsum=0;
29     for(i=0;i<sum;i++)
30     {
31         k=0;
32         for(j=i;j<sum;j++)
33         {
34                 if(j==i)
35                 {cur[k]=mice[j].num;temp=mice[i];}
36                 else if(temp.v>mice[j].v&&temp.w!=mice[j].w)
37                 {
38                         cur[++k]=mice[j].num;
39                         temp=mice[j];
40                 }
41         }
42         if(k+1>maxsum) {memcpy(end1,cur,sizeof(cur));maxsum=k+1;}
43     }
44     cout<<maxsum<<endl;
45     for(i=0;i<maxsum;i++)
46         cout<<end1[i]<<endl;
47    // }
48     return 0;
49 }