【转】http://blog.csdn.net/zxy_snow/article/details/6002534
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <memory.h>
#include <limits.h>
#include <stack>
#define N 1010
using namespace std;
typedef struct
{
int w,s,num;
}MICE;
MICE mice[N];
stack<int> S;
int cmp(const void *a,const void *b)
{
MICE *x = (MICE*)a;
MICE *y = (MICE*)b;
if( x->w == y->w )
return -y->s + x->s;
else
return x->w - y->w;
}
int ind[N];
int main(void)
{
int n=0,len[N];
while( cin >> mice[n].w >> mice[n].s )
{
mice[n].num = n;
n++;
}
memset(ind,0,sizeof(ind));
memset(len,0,sizeof(len));
qsort(mice,n,sizeof(MICE),cmp);
len[0] = 1;
for(int i=1; i<n; i++)
{
int sum = 0,temp;
for(int j=0; j<i; j++)
if( len[j] > sum && mice[i].w > mice[j].w && mice[i].s < mice[j].s )
{
temp = j;
sum = len[j];
}
if( sum != 0 )
ind[i] = temp;
else
ind[i] = 0;
sum++;
len[i] = sum;
}
int max = 0,tempi;
for(int i=0; i<n; i++)
if( len[i] > max )
max = len[tempi=i];
cout << max << endl;
int i = tempi;
while( ind[i] != 0 )
{
S.push(mice[i].num+1);
i = ind[i];
}
S.push(mice[i].num+1);
while( !S.empty() )
{
cout << S.top() << endl;
S.pop();
}
return 0;
}