HDOJ 1160 FatMouse's Speed

题意：有n只老鼠，分别知道每只老鼠的体重与速度，找到尽可能多的老鼠证明体重越轻的速度越快

链接：http://acm.hdu.edu.cn/showproblem.php?pid=1160

思路：最长LIS序列，按体重排序后，查找速度单调下降的最长序列。

注意点：无

以下为AC代码：

Run ID	Submit Time	Judge Status	Pro.ID	Exe.Time	Exe.Memory	Code Len.	Language	Author
11601236	2014-09-04 09:53:04	Accepted	1160	15MS	596K	2347B	G++	luminous11

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cctype>
#include <climits>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
//#include <unordered_map>
//#include <unordered_set>
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset( a , v , sizeof(a) )
#define pb push_back
#define RDI(a) scanf ( "%d", &a )
#define RDII(a, b) scanf ( "%d%d", &a, &b )
#define RDIII(a, b, c) scanf ( "%d%d%d", &a, &b, &c )
#define RS(s) scanf ( "%s", s )
#define PI(a) printf ( "%d", a )
#define PIL(a) printf ( "%d\n", a )
#define PII(a,b) printf ( "%d %d", a, b )
#define PIIL(a,b) printf ( "%d %d\n", a, b )
#define PIII(a,b,c) printf ( "%d %d %d", a, b, c )
#define PIIIL(a,b,c) printf ( "%d %d %d\n", a, b, c )
#define PL() printf ( "\n" )
#define PSL(s) printf ( "%s\n", s )
#define rep(i,m,n) for ( int i = m; i <  n; i ++ )
#define REP(i,m,n) for ( int i = m; i <= n; i ++ )
#define dep(i,m,n) for ( int i = m; i >  n; i -- )
#define DEP(i,m,n) for ( int i = m; i >= n; i -- )
#define repi(i,m,n,k) for ( int i = m; i <  n; i += k )
#define REPI(i,m,n,k) for ( int i = m; i <= n; i += k )
#define depi(i,m,n,k) for ( int i = m; i >  n; i += k )
#define DEPI(i,m,n,k) for ( int i = m; i >= n; i -= k )
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
using namespace std;
const double pi = acos(-1);
template <class T>
inline bool RD ( T &ret )
{
    char c;
    int sgn;
    if ( c = getchar(), c ==EOF )return 0; //EOF
    while ( c != '-' && ( c < '0' || c > '9' ) ) c = getchar();
    sgn = ( c == '-' ) ? -1 : 1;
    ret = ( c == '-' ) ? 0 : ( c - '0' );
    while ( c = getchar() , c >= '0' && c <= '9' ) ret = ret * 10 + ( c - '0' );
    ret *= sgn;
    return 1;
}
inline void PD ( int x )
{
    if ( x > 9 ) PD ( x / 10 );
    putchar ( x % 10 + '0' );
}
const double eps = 1e-10;
const int dir[4][2] = { 1,0, -1,0, 0,1, 0,-1 };
struct node{
    int cnt, wei, val;
    node(){}
    //node( int _x, int _y ) : wei(_x), val(_y) {}
    //node( int _x, int _y, int _cnt ) : x(_x), y(_y), cnt(_cnt) {}
    friend bool operator < ( const node &a, const node &b ){
        if ( a.wei != b.wei )
            return a.wei < b.wei;
        else if ( a.val != b.val )
            return a.val > b.val;
        else if ( a.cnt != b.cnt )
            return a.cnt < b.cnt;
    }
}num[1005];
struct DP{
    int cnt, pre;
}dp[1005];
int main()
{
    int cnt = 0;
    clr ( num, -1 );
    clr ( dp, 0 );
    while ( RDII ( num[cnt].wei, num[cnt].val ) != EOF ){
        num[cnt].cnt = cnt+1;
        cnt ++;
    }
    int tmp = 0;
    sort ( num, num + cnt );
    rep ( i, 0, cnt ){
        rep ( j, 0, i ){
            if ( dp[j].cnt == 0 ){
                dp[j].cnt = 1;
                dp[j].pre = -1;
            }
            if ( num[i].val < num[j].val && num[i].wei > num[j].wei && dp[i].cnt <= dp[j].cnt ){
                dp[i].cnt = dp[j].cnt + 1;
                dp[i].pre = j;
                if ( dp[i].cnt > dp[tmp].cnt ){
                    tmp = i;
                }
            }
        }
    }
    stack<int> ans;
    while ( ! ans.empty() )ans.pop();
    while ( tmp != -1 ){
        ans.push( num[tmp].cnt );
        tmp = dp[tmp].pre;
    }
    cout << ans.size() << endl;
    while ( ! ans.empty() ){
        cout << ans.top() << endl;
        ans.pop();
    }
    return 0;
}