HDOJ1160(最长子序列+路径追踪(并查集))

#include <iostream> 

#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <stack>
#include <math.h>
#include<iostream>


using namespace std;
#define INF  0xfffff;//0x代表十六进制
#define M 1010


struct aa
{
int w;
int v;
int num;
int mark;
}a[M];


int dp[M];


bool cmp(aa a, aa b)
{
return a.w < b.w;
}


int main()
{
int n = 1;
while (cin >> a[n].w)
{
a[n].num =n;
cin >> a[n++].v;


}
sort(a+1, a + n, cmp);
int m = 0;  //最大长度
int num;  //起点
for (int i = 1 ; i <= n; i++)
{
dp[i] = 1;  //初始化
a[i].mark = i;
for (int j = 1 ; j < i; j++)
{
if (a[i].w>a[j].w&&a[i].v<a[j].v)
{
if (dp[i] < dp[j] + 1)  //dp条件
{
dp[i] = dp[j] + 1;
a[i].mark = j;  //并查集实现
if (dp[i] > m) //最大树根节点
{
m = dp[i];
num = i;  
}
}
}
}


}
cout << m << endl;
for (int i = 1; i <= m; i++)  //最深树遍历
{
dp[i] = num;  //这里的dp数组只用来储存
num = a[num].mark;
}
for (int i = m; i >= 1; i--) cout << a[dp[i]].num << endl; //反向输出
}