题解 | 叠罗汉II

#include <algorithm>
#include <vector>
class Stack {
  public:
    int getHeight(vector<vector<int> > actors, int n) {
        // write code here
        sort(actors.begin(), actors.end());
        int max_count = 0;
        vector<int> dp(n, 1);
        for (int i = 1; i < n; ++i) {
            for (int j = 0; j < i; j++) {
                if (actors[j][0] < actors[i][0] && actors[j][1] < actors[i][1]) {
                    dp[i] = max(dp[i], dp[j] + 1);
                }

            }
            max_count = max(max_count, dp[i]);
        }
        return max_count;
    }
};