hdu1160 FatMouse's Speed（LIS普通法）

#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <vector>

using namespace std;

const int N = 1005;
const int INF = 1000000;

int n, dp
, pre
;

struct MICE
{
int w, s;
int id;
}mice
;

vector <int> mlen;

bool cmp(MICE x, MICE y)
{
if(x.w == y.w)
return x.s > y.s;
else return x.w < y.w;
}

int main()
{
//  freopen("in.txt", "r", stdin);
int i, j, k, maxl, idm;
n = 0;
while(~scanf("%d%d", &mice
.w, &mice
.s))
{
mice
.id = n + 1;
dp
= 1;
pre
= 0;
n ++;
}
maxl = -1;
mlen.clear();
sort(mice, mice + n, cmp);
for(i = 1; i < n; i ++)
for(j = 0; j < i; j ++)
{
if(mice[j].w < mice[i].w && mice[j].s > mice[i].s && dp[i] < dp[j] + 1)
{
dp[i] = dp[j] + 1;
pre[i] = j;
if(dp[i] > maxl)
{
maxl = dp[i];
idm = i; //最长子序列下标
}
}
}
int x = dp[idm];
printf("%d\n", dp[idm]);
while(idm)
{
mlen.push_back(idm);
idm = pre[idm];
}
for(i = x - 1; i >= 0; i --)
printf("%d\n", mice[mlen[i]].id);
return 0;
}