1 //观察是否满足矩形P1，在矩形P2内部
 2         public static bool IsMatch(rectAngle p1, rectAngle p2)
 3         {
 4             bool flag = (p1.getX() < p2.getX() && p1.getY() < p2.getY()) || (p1.getX() < p2.getY() && p1.getY() < p2.getX());
 5             return flag;
 6         }
 7
 8 public static int HaveRectangleCount(List<rectAngle> P)
 9         {
10             int[,] M = new int[P.Count, P.Count];
11             int[] dp = new int[P.Count];
12             int biggest = 0;
13             for (int k = 0; k < P.Count; k++)
14                 dp[k] = 1;
15             rectAngle[] x = new rectAngle[P.Count + 1];
16             x[0] = new rectAngle(0, 0);
17             //解法一
18             for (int i = 0; i < P.Count; i++)
19             {
20                 for (int j = count; j >= 0; j--)
21                 {
22                     if (IsMatch(x[j], P[i]))
23                     {
24                         x[j + 1] = new rectAngle(P[i].getX(), P[i].getY());
25                         if (j == count)
26                             count++;
27                         break;
28                     }
29                 }
30             }
31             outPutrectAngle(x.ToList<rectAngle>(), count);//输出一个满足条件的矩阵例子
32             Console.WriteLine("count=" + count);
33
34
35             //解法二、不断搜索，更新其排位表
36             for (int i = 0; i < P.Count; i++)
37             {
38                 for (int j = 0; j < P.Count; j++)
39                 {
40                     if (IsMatch(P[i], P[j]) && (dp[i] >= dp[j]))
41                         dp[j] = dp[i] + 1;
42                     Console.Write(dp[j] + "  ");//输出此时的每个元素的排位，观察其变化过程。
43                 }
44                 Console.WriteLine();
45             }
46
47             for (int i = 0; i < P.Count; i++)
48             {
49                 if (dp[i] > biggest)
50                     biggest = dp[i];
51             }
52             return biggest;
53         }
54
55 public static void outPutrectAngle(List<rectAngle> P, int Len)
56         {
57             for (int i = 1; i <= Len; i++)
58             {
59                 Console.Write("x=" + P[i].getX() + ",y=" + P[i].getY() + ",   ");
60             }
61             Console.WriteLine();
62         }