FatMouse's Speed

[cpp]

[cpp]
// File Name: hdu1160.cpp
// Author: rudolf
// Created Time: 2013年04月25日星期四 14时47分25秒

#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
const int maxn = 1005;
struct node
{
int w,v,num;
}mouse[ maxn ];
int dp[ maxn ];
int path[ maxn ];
int cmp( node a1,node a2 )
{
if( a1.w!=a2.w )
return a1.w else
return a1.v>a2.v;
}
int main()
{
int cnt=0;
while( scanf("%d%d",&mouse[ cnt ].w,&mouse[ cnt ].v)!=EOF )
{
mouse[ cnt ].num=cnt+1;
path[ cnt ]=-1;
cnt++;
}
sort( mouse,mouse+cnt,cmp );
int max_dp,max_num;
max_dp=max_num=0;
dp[ 0 ]=1;
for( int i=1;i {
int my_max=0;
for( int j=0;j {
if( mouse[ j ].v>mouse[ i ].v && my_max {
my_max=dp[ j ];
path[ i ]=j;
}
}
dp[ i ]=my_max+1;
if( max_dp {
max_dp=dp[ i ];
max_num=i;
}
}
stacks;
s.push( mouse[max_num].num );
while( path[max_num]!=-1 )
{
s.push(mouse[path[max_num]].num);
max_num=path[max_num];
}
printf("%d\n",s.size());
while( !s.empty() )
{
printf("%d\n",s.top() );
s.pop();
}
return 0;
}

// File Name: hdu1160.cpp
// Author: rudolf
// Created Time: 2013年04月25日星期四 14时47分25秒

#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
const int maxn = 1005;
struct node
{
int w,v,num;
}mouse[ maxn ];
int dp[ maxn ];
int path[ maxn ];
int cmp( node a1,node a2 )
{
if( a1.w!=a2.w )
return a1.w else
return a1.v>a2.v;
}
int main()
{
int cnt=0;
while( scanf("%d%d",&mouse[ cnt ].w,&mouse[ cnt ].v)!=EOF )
{
mouse[ cnt ].num=cnt+1;
path[ cnt ]=-1;
cnt++;
}
sort( mouse,mouse+cnt,cmp );
int max_dp,max_num;
max_dp=max_num=0;
dp[ 0 ]=1;
for( int i=1;i {
int my_max=0;
for( int j=0;j {
if( mouse[ j ].v>mouse[ i ].v && my_max {
my_max=dp[ j ];
path[ i ]=j;
}
}
dp[ i ]=my_max+1;
if( max_dp {
max_dp=dp[ i ];
max_num=i;
}
}
stacks;
s.push( mouse[max_num].num );
while( path[max_num]!=-1 )
{
s.push(mouse[path[max_num]].num);
max_num=path[max_num];
}
printf("%d\n",s.size());
while( !s.empty() )
{
printf("%d\n",s.top() );
s.pop();
}
return 0;
}