FatMouse's Speed、、（看看你表哥杰瑞。。。）

FatMouse believes that the fatter a mouse is, the faster it runs. To disprove this, you want to take the data on a collection of mice and put as large a subset of this data as possible into a sequence so that the weights are increasing, but the speeds are decreasing.
Input
Input contains data for a bunch of mice, one mouse per line, terminated by end of file.

The data for a particular mouse will consist of a pair of integers: the first representing its size in grams and the second representing its speed in centimeters per second. Both integers are between 1 and 10000. The data in each test case will contain information for at most 1000 mice.

Two mice may have the same weight, the same speed, or even the same weight and speed.
Output
Your program should output a sequence of lines of data; the first line should contain a number n; the remaining n lines should each contain a single positive integer (each one representing a mouse). If these n integers are m[1], m[2],…, m[n] then it must be the case that

W[m[1]] < W[m[2]] < … < W[m[n]]

and

S[m[1]] > S[m[2]] > … > S[m[n]]

In order for the answer to be correct, n should be as large as possible.
All inequalities are strict: weights must be strictly increasing, and speeds must be strictly decreasing. There may be many correct outputs for a given input, your program only needs to find one.

题目大意为输入几组数据，记录他们各自的下标后，输出一个最长的序列满足重量和速度的递增递减条件。
这种题不用说难点都在记录路径，我们需要额外设置一个数组来存储，还要在节点元素中设置关于他们本身的位置。
对于这个题来说，我们先按其中一种（重量和速度都可以）进行sort排序，后在其中检查最长递增（减）子序列就可以了。

#pragma warning (disable:4996)
#include <iostream>
#include <algorithm>
#include <cstring>
#include <stdio.h>
using namespace std;
struct node/*设置元素节点，v表示原下标*/
{
	int x, y;
	int v;
}a[1005];
#define maxn 1005
int dp[maxn];//这里的dp[i]指的是从第i个往后最长（？）子序列的长度
int nex[maxn];//用来储存最后结果序号的数组
bool cmp(node a, node b)//sort函数的第三参数
{
	if (a.x != b.x)
		return a.x < b.x;
	return a.y > b.y;
}
int main()
{
	int n = 1, x, y, ans = 0, fir;
	while (cin >> x >> y)
	{
		a[n].v = n;
		a[n].x = x;
		a[n++].y = y;
	}
	n--;
	sort(a + 1, a + n + 1, cmp);
	for (int i = n; i >= 1; i--)
	{
		int x = a[i].v;
		dp[i] = 1;
		nex[x] = n + 1;//输出终结之时
		for (int j = i + 1; j <= n; j++)
		{
			//int y = a[j].v;
			if (a[i].x<a[j].x&&a[i].y>a[j].y&&dp[i]<dp[j]+1)
			{
				dp[i] = max(dp[i], dp[j] + 1);
				nex[x] = a[j].v;//结尾的那个已经被处理过了在当i是已经被处理成n+1了
			}
		}
		if (ans < dp[i])
		{
			ans = max(ans, dp[i]);
			fir = x;//确保了输出的是我们所要的答案
		}
	}
	cout << ans << endl;
	while (fir != n + 1)
	{
		cout << fir << endl;
		fir = nex[fir];
	}
	system("pause");
	return 0;
}

完结